Implementing the Nelder-Mead simplex algorithm with adaptive parameters
The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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 · cited 2×
“The Nelder-Mead simplex algorithm [14] is the most widely used direct search method for solving the unconstrained optimization problem min f ( x ), (1.1) where f : R n → R is called the objective function and n the dimension.”
MethodInfluentialConvergence 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
Iterative Methods for Optimization
Kelley, C. T. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970920 · Cited by 2,052
Testing Unconstrained Optimization Software
Morè, J. J., Garbow, B. S., & Hillstrom, K. E. (1981) · ACM Transactions on Mathematical Software · doi:10.1145/355934.355936 · Cited by 1,709
Varberg, D. E. (1973) · Cited by 1,700
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
Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
McKinnon, K. I. M. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496303482 · Cited by 490
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
Direct search methods: Once scorned, now respectable
Wright, M. H. (1996) · Cited by 264
Direct Search Methods on Parallel Machines
Dennis, Jr., & Torczon, V. (1991) · SIAM Journal on Optimization · doi:10.1137/0801027 · Cited by 251
Kelley, C. T. (1999) · SIAM Journal on Optimization · doi:10.1137/s1052623497315203 · Cited by 232
Multidirectional search: a direct search algorithm for parallel machines
Torczon, V. J., & Dennis, J. E. (1989) · Rice Research Repository (Rice University) · Cited by 201
A Convergent Variant of the Nelder–Mead Algorithm
Price, C. J., Coope, I. D., & Byatt, D. (2002) · Journal of Optimization Theory and Applications · doi:10.1023/a:1014849028575 · Cited by 135
Effect of dimensionality on the Nelder–Mead simplex method
Han, L., & Neumann, M. (2006) · Optimization Methods and Software · doi:10.1080/10556780512331318290 · Cited by 127 · cited 3×
“We will use this property to give some new explanations about the effect of dimensionality on the standard Nelder-Mead algorithm, which complement the existing ones given in Torczon [16] and in Han and Neumann [6].”
MethodResultSelf-citationOptimization 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
Towards a Discrete Newton Method with Memory for Large-Scale Optimization
Byrd, R. H., Nocedal, J., & Zhu, C. (1996) · Springer eBooks · doi:10.1007/978-1-4899-0289-4_1 · Cited by 25
New Computing Environments: MicroComputers in Large-Scale Scientific Computing
Wouk, A. (1987) · Society for Industrial and Applied Mathematics eBooks · Cited by 18
Cited by
Vaccine optimization for COVID-19: Who to vaccinate first?
Matrajt, L., Eaton, J., Leung, T., & Brown, E. R. (2021) · Science Advances · doi:10.1126/sciadv.abf1374 · Cited by 419
Derivative-free optimization methods
Larson, J., Menickelly, M., & Wild, S. M. (2019) · Acta Numerica · doi:10.1017/s0962492919000060 · Cited by 381
Yin, Z., Jin, Y., Shen, J. S., & Hicher, P. (2018) · International Journal for Numerical and Analytical Methods in Geomechanics · doi:10.1002/nag.2714 · Cited by 282
Variational quantum state diagonalization
LaRose, R., Tikku, A., O’Neel-Judy, É., Cincio, L., & Coles, P. J. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0167-6 · Cited by 199
“[50] F.”
MethodClassical Optimizers for Noisy Intermediate-Scale Quantum Devices
Lavrijsen, W., Tudor, A., Müller, J., Iancu, C., & de Jong, W. (2020) · arXiv · doi:10.48550/arxiv.2004.03004 · Cited by 103
Metadata
- Authors
- Gao, F., & Han, L.
- Venue
- Computational Optimization and Applications
- Published
- 2010-05-04
- Volume
- 51
- Issue
- 1
- Pages
- 259-277
- ISSN
- 0926-6003 (ISSN-L)
- 1573-2894
- OpenAlex
- W2169369819
- Cited by
- 1,090
- References
- 18
- FWCI
- 4.15
- 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
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.