Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- 1 January 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 9 (1) , 112-147
- https://doi.org/10.1137/s1052623496303470
Abstract
The Nelder--Mead simplex algorithm, first published in 1965, is an enormously popular direct search method for multidimensional unconstrained minimization. Despite its widespread use, essentially no theoretical results have been proved explicitly for the Nelder--Mead algorithm. This paper presents convergence properties of the Nelder--Mead algorithm applied to strictly convex functions in dimensions 1 and 2. We prove convergence to a minimizer for dimension 1, and various limited convergence results for dimension 2. A counterexample of McKinnon gives a family of strictly convex functions in two dimensions and a set of initial conditions for which the Nelder--Mead algorithm converges to a nonminimizer. It is not yet known whether the Nelder--Mead method can be proved to converge to a minimizer for a more specialized class of convex functions in two dimensions.Keywords
This publication has 6 references indexed in Scilit:
- Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease ConditionSIAM Journal on Optimization, 1999
- Fortified-Descent Simplicial Search Method: A General ApproachSIAM Journal on Optimization, 1999
- Convergence of the Nelder--Mead Simplex Method to a Nonstationary PointSIAM Journal on Optimization, 1998
- On the Convergence of Pattern Search AlgorithmsSIAM Journal on Optimization, 1997
- Direct Search Methods on Parallel MachinesSIAM Journal on Optimization, 1991
- A Simplex Method for Function MinimizationThe Computer Journal, 1965