Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions

@article{Lagarias1998ConvergencePO,
  title={Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions},
  author={Jeffrey C. Lagarias and James A. Reeds and Margaret H. Wright and Paul E. Wright},
  journal={SIAM Journal on Optimization},
  year={1998},
  volume={9},
  pages={112-147}
}
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… CONTINUE READING
Highly Influential
This paper has highly influenced 79 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 4,573 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
1,557 Citations
15 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 1,557 extracted citations

4,573 Citations

0200400'98'02'07'12'17
Citations per Year
Semantic Scholar estimates that this publication has 4,573 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

A simplex method for function minimization

  • J. A. Nelder, R. Mead
  • Computer Journal 7
  • 1965
Highly Influential
6 Excerpts

Direct search methods: Once scorned

  • M. H. Wright
  • now respectable, in Numerical Analysis 1995…
  • 1996
1 Excerpt

Sequential Simplex Optimization

  • F. H. Walters, L. R. Parker, S. L. Morgan, S. N. Deming
  • CRC Press, Boca Raton, FL
  • 1991
1 Excerpt

Similar Papers

Loading similar papers…