Journal article · 1965

A Simplex Method for Function Minimization

John Ashworth Nelder, R. Mead

The Computer Journal, 7(4), 308–313 · Published 1 January 1965 · DOI 10.1093/comjnl/7.4.308

View at the publisherCite this paper

In brief

“A Simplex Method for Function Minimization” is a 1965 journal article by John Ashworth Nelder and R. Mead, published in The Computer Journal. OpenAlex counts 29,557 citations as of 16 November 2026, which puts it in the top 1% of works published in 1965 by citations. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
29,557
Most cited in
2021 (1,283)
Field-weighted impact
9.95
References
3
Authors
2

Abstract

A method is described for the minimization of a function of n variables, which depends on the comparison of function values at the (n + 1) vertices of a general simplex, followed by the replacement of the vertex with the highest value by another point. The simplex adapts itself to the local landscape, and contracts… Read the full abstract at the publisher.

Excerpt. This paper is not open access.

Cite this paper

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

APA 7

Nelder, J. A., & Mead, R. (1965). A Simplex Method for Function Minimization. The Computer Journal, 7(4), 308–313. https://doi.org/10.1093/comjnl/7.4.308

MLA 9

Nelder, John Ashworth, and R. Mead. “A Simplex Method for Function Minimization.” The Computer Journal, vol. 7, no. 4, 1965, pp. 308–313. https://doi.org/10.1093/comjnl/7.4.308.

Chicago

Nelder, John Ashworth and R. Mead. 1965. “A Simplex Method for Function Minimization.” The Computer Journal 7 (4): 308–313. https://doi.org/10.1093/comjnl/7.4.308.

Harvard

Nelder, J. A. and Mead, R. (1965) ‘A Simplex Method for Function Minimization’, The Computer Journal, 7(4), pp. 308–313. doi:10.1093/comjnl/7.4.308.

IEEE

J. A. Nelder and R. Mead, “A Simplex Method for Function Minimization,” The Computer Journal, vol. 7, no. 4, pp. 308–313, 1965, doi: 10.1093/comjnl/7.4.308.

BibTeX

@article{nelder1965simplex,
  title     = {{A Simplex Method for Function Minimization}},
  author    = {Nelder, John Ashworth and Mead, R.},
  journal   = {The Computer Journal},
  year      = {1965},
  volume    = {7},
  number    = {4},
  pages     = {308--313},
  doi       = {10.1093/comjnl/7.4.308},
  url       = {https://doi.org/10.1093/comjnl/7.4.308}
}

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

Citations by year

YearCitationsShare of the best year
20171,1651165
20181,1121112
20191,1391139
20201,1491149
20211,2831283
20221,1411141
20231,1671167
20241,0901090
20251,0071007
2026870870

Its field-weighted citation impact is 9.95: it has been cited 9.95 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

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

  • simplex method
  • function minimization
  • statistical estimation
  • computational efficiency

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?

Nelder, J. A., & Mead, R. (1965). A Simplex Method for Function Minimization. The Computer Journal, 7(4), 308–313. https://doi.org/10.1093/comjnl/7.4.308

How many times has this paper been cited?

29,557 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?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

John Ashworth Nelder, R. Mead.

What is the DOI of this paper?

10.1093/comjnl/7.4.308. The permanent link is https://doi.org/10.1093/comjnl/7.4.308.

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.