Convergence of the Restricted Nelder--Mead Algorithm in Two Dimensions
Authors:
- Jeffrey C. LagariasJLJeffrey C. Lagarias
- Bjorn PoonenBPBjorn Poonen
- Margaret H. WrightMWMargaret H. Wright
- 1 January 2012
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 22 (2) , 501-532
Abstract
The Nelder--Mead algorithm, a longstanding direct search method for unconstrained optimization published in 1965, is designed to minimize a scalar-valued function $f$ of $n$ real variables using only function values, without any derivative information. Each Nelder--Mead iteration is associated with a nondegenerate simplex defined by $n + 1$ vertices and their function values; a typical iteration produces a new simplex by replacing the worst vertex by a new point. Despite the method's widespread use, theoretical results have been limited: for strictly convex objective functions of one variable with bounded level sets, the algorithm always converges to the minimizer; for such functions of two variables, the diameter of the simplex converges to zero but examples constructed by McKinnon show that the algorithm may converge to a nonminimizing point. This paper considers the restricted Nelder--Mead algorithm, a variant that does not allow expansion steps. In two dimensions we show that for any nondegenerate starting simplex and any twice-continuously differentiable function with positive definite Hessian and bounded level sets, the algorithm always converges to the minimizer. The proof is based on treating the method as a discrete dynamical system and relies on several techniques that are nonstandard in convergence proofs for unconstrained optimization.
Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Effect of dimensionality on the Nelder–Mead simplex methodOptimization Methods and Software, 2006
- Mesh Adaptive Direct Search Algorithms for Constrained OptimizationSIAM Journal on Optimization, 2006
- Convergence Results for Generalized Pattern Search Algorithms are TightOptimization and Engineering, 2004
- Optimization by Direct Search: New Perspectives on Some Classical and Modern MethodsSIAM Review, 2003
- Gilding the Lily: A Variant of the Nelder-Mead Algorithm Based on Golden-Section SearchComputational Optimization and Applications, 2002
- Analysis of Generalized Pattern SearchesSIAM Journal on Optimization, 2002
- On the Convergence of Grid-Based Methods for Unconstrained OptimizationSIAM Journal on Optimization, 2001
- Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease ConditionSIAM Journal on Optimization, 1999
- Convergence of the Nelder--Mead Simplex Method to a Nonstationary PointSIAM Journal on Optimization, 1998
- Convergence Properties of the Nelder--Mead Simplex Method in Low DimensionsSIAM Journal on Optimization, 1998