Abstract
This paper analyzes the behavior of the Nelder--Mead simplex method for a family of examples which cause the method to converge to a nonstationary point. All the examples use continuous functions of two variables. The family of functions contains strictly convex functions with up to three continuous derivatives. In all the examples the method repeatedly applies the inside contraction step with the best vertex remaining fixed. The simplices tend to a straight line which is orthogonal to the steepest descent direction. It is shown that this behavior cannot occur for functions with more than three continuous derivatives. The stability of the examples is analyzed.
Keywords
MathematicsSimplexConvergence (economics)Line searchRegular polygonMathematical optimizationContraction (grammar)Simplex algorithmStability (learning theory)Vertex (graph theory)Applied mathematicsPoint (geometry)Convex optimizationConvex functionLinear programmingCombinatoricsGraphGeometryComputer science
Related Publications
Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
The Nelder--Mead simplex algorithm, first published in 1965, is an enormously popular direct search method for multidimensional unconstrained minimization. Despite its widesprea...
Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
The Nelder--Mead algorithm can stagnate and converge to a nonoptimal point, even for very simple problems. In this note we propose a test for sufficient decrease which, if passe...
Fortified-Descent Simplicial Search Method: A General Approach
We propose a new simplex-based direct search method for unconstrained minimization of a real-valued function f of n variables. As in other methods of this kind, the intent is to...
Multidirectional search: a direct search algorithm for parallel machines
In recent years there has been a great deal of interest in the development of optimization algorithms which exploit the computational power of parallel computer architectures. W...
Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
A new global optimization algorithm for functions of continuous variables is presented, derived from the “Simulated Annealing” algorithm recently introduced in combinatorial opt...
Publication Info
- Year
- 1998
- Type
- article
- Volume
- 9
- Issue
- 1
- Pages
- 148-158
- Citations
- 469
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
469
OpenAlex
Cite This
K. I. M. McKinnon
(1998).
Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point.
SIAM Journal on Optimization
, 9
(1)
, 148-158.
https://doi.org/10.1137/s1052623496303482
Identifiers
- DOI
- 10.1137/s1052623496303482