An Overview of Parallel Methods for Unconstrained

This paper presents an overview of parallel algorithms for unconstrained optimisation. The suitability of algorithms to the PUMA architecture are discussed and the difficulties involved in combining within an algorithmic cost model the high level function evaluation cost with low level communications cost. Some sections of the linear algebra are highlighted as requiring further study to develop more efficient parallel optimisation algorithms.