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

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

Han, Lixing, Neumann, Michael · 2006 · Optimization Methods and Software

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

Crossref · 10.1080/10556780512331318290

Cites

24 of 24 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 23 references

Research works printed but not linked: 1

  1. Woods D. J. 1985 . An iterative approach for solving multi-objective optimization problems . PhD thesis Rice University TX

Cited by

See all 127

Metadata

Authors
Han, L., & Neumann, M.
Affiliations
  • University of Michigan–Flint (US)
  • University of Connecticut (US)
Corresponding author
Han, Lixing
Venue
Optimization Methods and Software
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.