The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
A Direct Search Optimization Method That Models the Objective and Constraint Functions by Linear Interpolation
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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×
“In particular, the method of Neider and Mead (1965) is used in very many fields to calculate the least value of a function F(~.), ~ E 'R,n, when there are no constraints on the variables.”
MethodPractical Methods of Optimization.
Witzgall, C., & Fletcher, R. (1989) · Mathematics of Computation · doi:10.2307/2008742 · Cited by 3,591
An Automatic Method for Finding the Greatest or Least Value of a Function
Rosenbrock, H. H. (1960) · The Computer Journal · doi:10.1093/comjnl/3.3.175 · Cited by 2,957
Himmelblau, D. M. (1972) · Cited by 2,532
A fast algorithm for nonlinearly constrained optimization calculations
Powell, M. J. D. (1978) · Lecture Notes in Mathematics · doi:10.1007/bfb0067703 · Cited by 1,661
Self-citationSequential 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
More Test Examples for Nonlinear Programming Codes
Schittkowski, K. (1987) · Lecture notes in economics and mathematical systems · doi:10.1007/978-3-642-61582-5 · Cited by 1,163
A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems
Griffith, R. E., & Stewart, R. A. D. (1961) · Management Science · doi:10.1287/mnsc.7.4.379 · Cited by 335
Schittkowski, K. (1980) · Lecture notes in economics and mathematical systems · doi:10.1007/978-3-642-46424-9 · Cited by 212
An extension of the simplex method to constrained nonlinear optimization
Subrahmanyam, M. B. (1989) · Journal of Optimization Theory and Applications · doi:10.1007/bf00941060 · Cited by 49
Cited by
SciPy 1.0: fundamental algorithms for scientific computing in Python
Virtanen, P., Gommers, R., Oliphant, T. E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., et al. (2020) · Nature Methods · doi:10.1038/s41592-019-0686-2 · Cited by 38,430
SciPy 1.0: fundamental algorithms for scientific computing in Python
Virtanen, P., Gommers, R., Oliphant, T. E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., et al. (2019) · Apollo - University of Cambridge Repository · doi:10.17863/cam.64134 · Cited by 10,460
(2012) · Cited by 8,009
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
Recent approaches to global optimization problems through Particle Swarm Optimization
Parsopoulos, K. E., & Vrahatis, M. N. (2002) · Natural Computing · doi:10.1023/a:1016568309421 · Cited by 1,406
Metadata
- Authors
- Powell, M. J. D.
- Affiliations
- University of Cambridge (GB)
- Corresponding author
- Powell, M. J. D.
- Venue
- Advances in Optimization and Numerical Analysis
- Publisher
- Springer Netherlands
- Published
- 1994
- Pages
- 51-67
- OpenAlex
- W1451881698
- Semantic Scholar
- 38bcb711e38e1c702d4c1851461708bd32970394
- Cited by
- 1,369
- References
- 10
- Citations by year
- 2026: 90 · 2025: 155 · 2024: 154 · 2023: 121 · 2022: 130 · 2021: 117 · 2020: 91 · 2019: 85 · 2018: 72 · 2017: 67 · 2016: 45 · 2015: 45 · 2014: 39 · 2013: 28 · 2012: 22
- FWCI
- 10.62
- Type
- book chapter
- Language
- en
- Open access
- closed
- Locations
- Springer eBooks (publishedVersion)
- OpenGrey (Institut de l'Information Scientifique et Technique) (submittedVersion)
- 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 › Optimization and Variational Analysis
- Keywords
- direct search optimization, nonlinearly constrained optimization, derivative-free optimization, linear interpolation, simplex, trust region, merit function, constraint violation, convergence analysis
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: A Direct Search Optimization Method That Models the Objective and Constraint Functions by Linear Interpolation. https://app.cochat.ai/papers/10.1007/978-94-015-8330-5_4
- The paper
- Powell, M. J. D. (1994). A Direct Search Optimization Method That Models the Objective and Constraint Functions by Linear Interpolation. Advances in Optimization and Numerical Analysis. https://doi.org/10.1007/978-94-015-8330-5_4
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.