Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
- 1 January 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 9 (1) , 148-158
- https://doi.org/10.1137/s1052623496303482
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
This publication has 7 references indexed in Scilit:
- Fortified-Descent Simplicial Search Method: A General ApproachSIAM Journal on Optimization, 1999
- Convergence Properties of the Nelder--Mead Simplex Method in Low DimensionsSIAM 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
- On the Convergence of the Multidirectional Search AlgorithmSIAM Journal on Optimization, 1991
- A Simplex Method for Function MinimizationThe Computer Journal, 1965
- Sequential Application of Simplex Designs in Optimisation and Evolutionary OperationTechnometrics, 1962