Journal article · 2024 · Open access

The Nelder–Mead Simplex Algorithm Is Sixty Years Old: New Convergence Results and Open Questions

Aurél Galántai

Algorithms, 17(11), 523 · Published 14 November 2024 · DOI 10.3390/a17110523

Read the free full textCite this paper

In brief

“The Nelder–Mead Simplex Algorithm Is Sixty Years Old: New Convergence Results and Open Questions” is a 2024 journal article by Aurél Galántai, published in Algorithms. OpenAlex counts 8 citations as of 16 November 2026, which puts it in the top 5% of works published in 2024 by citations. It is open access under a CC BY licence: the full text is free to read at Algorithms.

Citations
8
Most cited in
2026 (5)
Field-weighted impact
2.29
References
29
Authors
1

Abstract

We investigate and compare two versions of the Nelder–Mead simplex algorithm for function minimization. Two types of convergence are studied: the convergence of function values at the simplex vertices and convergence of the simplex sequence. For the first type of convergence, we generalize the main result of Lagarias, Reeds, Wright and Wright (1998). For the second type of convergence, we also improve recent results which indicate that the Lagarias et al.’s version of the Nelder–Mead algorithm has better convergence properties than the original Nelder–Mead method. This paper concludes with some open questions.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Galántai, A. (2024). The Nelder–Mead Simplex Algorithm Is Sixty Years Old: New Convergence Results and Open Questions. Algorithms, 17(11), 523. https://doi.org/10.3390/a17110523

MLA 9

Galántai, Aurél. “The Nelder–Mead Simplex Algorithm Is Sixty Years Old: New Convergence Results and Open Questions.” Algorithms, vol. 17, no. 11, 2024, p. 523. https://doi.org/10.3390/a17110523.

Chicago

Galántai, Aurél. 2024. “The Nelder–Mead Simplex Algorithm Is Sixty Years Old: New Convergence Results and Open Questions.” Algorithms 17 (11): 523. https://doi.org/10.3390/a17110523.

Harvard

Galántai, A. (2024) ‘The Nelder–Mead Simplex Algorithm Is Sixty Years Old: New Convergence Results and Open Questions’, Algorithms, 17(11), p. 523. doi:10.3390/a17110523.

IEEE

A. Galántai, “The Nelder–Mead Simplex Algorithm Is Sixty Years Old: New Convergence Results and Open Questions,” Algorithms, vol. 17, no. 11, p. 523, 2024, doi: 10.3390/a17110523.

BibTeX

@article{galantai2024nelder,
  title     = {{The Nelder–Mead Simplex Algorithm Is Sixty Years Old: New Convergence Results and Open Questions}},
  author    = {Galántai, Aurél},
  journal   = {Algorithms},
  year      = {2024},
  volume    = {17},
  number    = {11},
  pages     = {523},
  doi       = {10.3390/a17110523},
  url       = {https://doi.org/10.3390/a17110523}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research

  • Nelder-Mead algorithm
  • function minimization
  • convergence analysis
  • derivative-free optimization

Work with this paper

Most-cited papers in Mathematics

All highly cited Mathematics papers

Questions about this paper

How do I cite this paper in APA style?

Galántai, A. (2024). The Nelder–Mead Simplex Algorithm Is Sixty Years Old: New Convergence Results and Open Questions. Algorithms, 17(11), 523. https://doi.org/10.3390/a17110523

How many times has this paper been cited?

8 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access: read the free full text at Algorithms.

Who wrote this paper?

Aurél Galántai.

What is the DOI of this paper?

10.3390/a17110523. The permanent link is https://doi.org/10.3390/a17110523.

Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.