The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Effect of dimensionality on the Nelder–Mead simplex method
Abstract
The effect of dimensionality on the widely used Nelder–Mead simplex method for unconstrained optimization is investigated. It is shown that by using the quadratic function f(x)=x T x, the Nelder–Mead simplex method deteriorates as the dimension increases.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“This work and its successors 375,376 are the only examples of native simulation of bosonic chemical systems on a quantum device to date.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [376]
In the citing paper
“In Sparrow et al. 376 , the authors simulate the vibrational quantum dynamics of a variety of molecules (H 2 CS, SO 3 , HNCO, HFHF, N 4 and P 4 ), both in the harmonic and anharmonic regime, using a reprogrammable photonic chip.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [376]
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 4×
“For example, given the tolerance, tol, Nelder and Mead [12] suggest termination when where Another termination criterion suggested by Torczon [18] and Woods [21] is where (cid:5) · (cid:5) denotes the Euclidean norm.”
BackgroundMethodInfluentialConvergence 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
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
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
Numerical Methods for Non-Linear Optimization
Vajda, S., & Lootsma, F. A. (1973) · Operational Research Quarterly (1970-1977) · doi:10.2307/3008352 · Cited by 589
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
Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
Spendley, W., Hext, G. R., & Himsworth, F. R. (1962) · Technometrics · doi:10.2307/1266283 · Cited by 368
Functional stability analysis of numerical algorithms
Rowan, T. H. (1990) · Cited by 336
Direct search methods: Once scorned, now respectable
Wright, M. H. (1996) · Cited by 264
Research works printed but not linked: 1
- Woods D. J. 1985 . An iterative approach for solving multi-objective optimization problems . PhD thesis Rice University TX
Cited by
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J., Degroote, M., Johnson, P., Kieferová, M., Kivlichan, I., Menke, T., Peropadre, B., Sawaya, N., et al. (n.d.) · OPUS - Open Publications of UTS Scholars (University of Technology Sydney) · Cited by 1,265
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
“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-citationSchlegel, H. B. (2011) · WIREs Computational Molecular Science · doi:10.1002/wcms.34 · Cited by 360
Optimum stacking sequence design of composite materials Part I: Constant stiffness design
Ghiasi, H., Pasini, D., & Lessard, L. (2009) · Composite Structures · doi:10.1016/j.compstruct.2009.01.006 · Cited by 346
“less than 10), but the convergence rate decreases exponentially with an increase of the number of variables [45].”
Background
Metadata
- Authors
- Han, L., & Neumann, M.
- Affiliations
- University of Michigan–Flint (US)
- University of Connecticut (US)
- Corresponding author
- Han, Lixing
- ORCID
- Neumann, Michael
- Venue
- Optimization Methods and Software
- Publisher
- Informa UK Limited
- Published
- 2006-02
- Volume
- 21
- Issue
- 1
- Pages
- 1-16
- ISSN
- 1026-7670 (ISSN-L)
- 1055-6788
- 1029-4937
- OpenAlex
- W2016387335
- Cited by
- 127
- References
- 23
- Citations by year
- 2026: 5 · 2025: 7 · 2024: 8 · 2023: 10 · 2022: 14 · 2021: 16 · 2020: 10 · 2019: 10 · 2018: 10 · 2017: 3 · 2016: 2 · 2015: 4 · 2014: 3 · 2013: 3 · 2012: 8
- FWCI
- 0.79
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Optimization methods & software (publishedVersion)
- Funders
- National Science Foundation
- Topics
- Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
- Keywords
- Nelder-Mead algorithm, dimensionality, unconstrained optimization, quadratic functions, algorithm performance, high-dimensional optimization
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: Effect of dimensionality on the Nelder–Mead simplex method. https://app.cochat.ai/papers/10.1080/10556780512331318290
- The paper
- Han, L., & Neumann, M. (2006). Effect of dimensionality on the Nelder–Mead simplex method. Optimization Methods and Software. https://doi.org/10.1080/10556780512331318290
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.