The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
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.
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.
Integrity signals
Registry
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.
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
Cites
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
Lagarias, J. C., Reeds, J. A., Wright, M. H., & Wright, P. E. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496303470 · Cited by 7,447
Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
Spendley, W., Hext, G. R., & Himsworth, F. R. (1962) · Technometrics · doi:10.1080/00401706.1962.10490033 · Cited by 1,379
On the Convergence of Pattern Search Algorithms
Torczon, V. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623493250780 · Cited by 1,336
Direct Search Methods on Parallel Machines
Dennis, J. E., & Torczon, V. (1992) · Operations Research ’91 · doi:10.1007/978-3-642-48417-9_2 · Cited by 279
On the Convergence of the Multidirectional Search Algorithm
Torczon, V. (1991) · SIAM Journal on Optimization · doi:10.1137/0801010 · Cited by 260
Direct Search Methods on Parallel Machines
Dennis, Jr., & Torczon, V. (1991) · SIAM Journal on Optimization · doi:10.1137/0801027 · Cited by 251
Multidirectional search: a direct search algorithm for parallel machines
Torczon, V. J., & Dennis, J. E. (1989) · Rice Research Repository (Rice University) · Cited by 201
Optimization on Microcomputers: The Nelder-Mead Simplex Algorithm
Dennis, J. E., E., W. J., & Daniel, J. (1985) · doi:10.21236/ada453814 · Cited by 97
Fortified-Descent Simplicial Search Method: A General Approach
Tseng, P. (1999) · SIAM Journal on Optimization · doi:10.1137/s1052623495282857 · Cited by 89
Cited by
Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
Lagarias, J. C., Reeds, J. A., Wright, M. H., & Wright, P. E. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496303470 · Cited by 7,447
Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods
Kolda, T. G., Lewis, R. M., & Torczon, V. (2003) · SIAM Review · doi:10.1137/s003614450242889 · Cited by 1,653
Derivative-free optimization: a review of algorithms and comparison of software implementations
Rios, L. M., & Sahinidis, N. V. (2013) · Journal of Global Optimization · doi:10.1007/s10898-012-9951-y · Cited by 1,276
Implementing the Nelder-Mead simplex algorithm with adaptive parameters
Gao, F., & Han, L. (2012) · Computational Optimization and Applications · doi:10.1007/s10589-010-9329-3 · Cited by 1,090
Direct search methods: then and now
Lewis, R. M., Torczon, V., & Trosset, M. W. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00423-4 · Cited by 648
Metadata
- Authors
- McKinnon, K. I. M.
- Venue
- SIAM Journal on Optimization
- Published
- 1998-01
- Volume
- 9
- Issue
- 1
- Pages
- 148-158
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W1965748532
- Cited by
- 490
- References
- 10
- FWCI
- 5.13
- Type
- journal article
- Language
- en
- Open access
- closed
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: Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point. https://app.cochat.ai/papers/10.1137/s1052623496303482
- The paper
- McKinnon, K. I. M. (1998). Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point. SIAM Journal on Optimization. https://doi.org/10.1137/s1052623496303482
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.