Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 259

The DOI matches its Crossref record.

Nelder-Mead algorithm

Open access
Singer, Saša, Nelder, John·2009·Scholarpedia

Abstract

The Nelder-Mead simplex algorithm finds a minimum of a function of several variables without differentiation. It is widely used, even though too little is known about its convergence properties. See Nelder, J.A. and Mead, R., "A Simplex Method for Function Minimization", Computer Journal, Vol. 7, Issue 4 (1965), 308-313 for the original article, and see Lagarias, Jeffrey C., James A. Reeds, Margaret H. Wright, and Paul E. Wright, "Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions," SIAM Journal on Optimization, Vol. 9, No. 1 (1998), 112-147.for a more contemporary view of the algorithm. A Google Scholar (scholar.google.com) search on "Nelder-Mead" will demonstrate the level of current activity investigating this algorithm. The Nelder-Mead algorithm is one of those great ideas that turns out to be widely effective and very difficult to analyze mathematically. To begin, we need a definition.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.4249/scholarpedia.2928

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 259

Metadata

Authors
Singer, S., & Nelder, J.
Venue
Scholarpedia
Publisher
Scholarpedia
Published
2009
Volume
4
Issue
7
Pages
2928
ISSN
1941-6016 (ISSN-L)
OpenAlex
W1985700489
Cited by
259
References
0
FWCI
4.36
Type
journal article
Language
en
Open access
diamond

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Nelder-Mead algorithm. https://app.cochat.ai/papers/10.4249/scholarpedia.2928
The paper
Singer, S., & Nelder, J. (2009). Nelder-Mead algorithm. Scholarpedia. https://doi.org/10.4249/scholarpedia.2928

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.