Book chapter · 2009
8. Simplicial Direct-Search Methods
Society for Industrial and Applied Mathematics eBooks, 141–162 · Published 1 January 2009 · DOI 10.1137/1.9780898718768.ch8
In brief
“8. Simplicial Direct-Search Methods” is a 2009 book chapter, published in Society for Industrial and Applied Mathematics eBooks. OpenAlex counts 0 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 0
Abstract
The Nelder—Mead algorithm [177] is one of the most popular derivative-free methods. It has been extensively used in the engineering community and is probably the most widely cited of the direct-search methods (the 1965 paper by Nelder and Mead [177] is officially a Science Citation Classic). Among the reasons for its success are its simplicity… Read the full abstract at the publisher.
Excerpt. This paper is not open access.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
8. Simplicial Direct-Search Methods. (2009). Society for Industrial and Applied Mathematics eBooks, 141–162. https://doi.org/10.1137/1.9780898718768.ch8
MLA 9
“8. Simplicial Direct-Search Methods.” Society for Industrial and Applied Mathematics eBooks, 2009, pp. 141–162. https://doi.org/10.1137/1.9780898718768.ch8.
Chicago
2009. “8. Simplicial Direct-Search Methods.” Society for Industrial and Applied Mathematics eBooks: 141–162. https://doi.org/10.1137/1.9780898718768.ch8.
Harvard
(2009) ‘8. Simplicial Direct-Search Methods’, Society for Industrial and Applied Mathematics eBooks, pp. 141–162. doi:10.1137/1.9780898718768.ch8.
IEEE
“8. Simplicial Direct-Search Methods,” Society for Industrial and Applied Mathematics eBooks, pp. 141–162, 2009, doi: 10.1137/1.9780898718768.ch8.
BibTeX
@incollection{anon2009simplicial,
title = {{8. Simplicial Direct-Search Methods}},
booktitle = {Society for Industrial and Applied Mathematics eBooks},
publisher = {Society for Industrial and Applied Mathematics},
year = {2009},
pages = {141--162},
doi = {10.1137/1.9780898718768.ch8},
url = {https://doi.org/10.1137/1.9780898718768.ch8}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Nelder-Mead algorithm
- direct search methods
- derivative-free optimization
- simplex method
- global convergence
- critical points
- centroid
- function minimization
Work with this paper
Most-cited papers in Mathematics
- Random ForestsLeo Breiman · Machine Learning · 2001 · 142,830 citations
- Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple TestingYoav Benjamini, Yosef Hochberg · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1995 · 113,923 citations
- Fitting Linear Mixed-Effects Models Using lme4Douglas M. Bates, Martin Maechler, Benjamin M. Bolker and 1 more · Journal of Statistical Software · 2015 · 100,328 citations
- The moderator-mediator variable distinction in social psychological research: Conceptual, strategic, and statistical considerations.Reuben M. Baron, David A. Kenny · Journal of Personality and Social Psychology · 1986 · 95,866 citations
- Using multivariate statisticsBarbara Gerson Tabachnick, Linda S. Fidell · 1983 · 79,867 citations
Questions about this paper
How do I cite this paper in APA style?
8. Simplicial Direct-Search Methods. (2009). Society for Industrial and Applied Mathematics eBooks, 141–162. https://doi.org/10.1137/1.9780898718768.ch8
How many times has this paper been cited?
0 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.
What is the DOI of this paper?
10.1137/1.9780898718768.ch8. The permanent link is https://doi.org/10.1137/1.9780898718768.ch8.
Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.