The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Direct search algorithms for optimization calculations
Abstract
Many different procedures have been proposed for optimization calculations when first derivatives are not available. Further, several researchers have contributed to the subject, including some who wish to prove convergence theorems, and some who wish to make any reduction in the least calculated value of the objective function. There is not even a key idea that can be used as a foundation of a review, except for the problem itself, which is the adjustment of variables so that a function becomes least, where each value of the function is returned by a subroutine for each trial vector of variables. Therefore the paper is a collection of essays on particular strategies and algorithms, in order to consider the advantages, limitations and theory of several techniques. The subjects addressed are line search methods, the restriction of vectors of variables to discrete grids, the use of geometric simplices, conjugate direction procedures, trust region algorithms that form linear or quadratic approximations to the objective function, and simulated annealing. We study the main features of the methods themselves, instead of providing a catalogue of references to published work, because an understanding of these features may be very helpful to future research.
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
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 8×
“We consider also the algorithm of Nelder and Mead (1965), because it has become the most popular simplex method in practice for unconstrained optimization.”
BackgroundMethodInfluentialPractical methods of optimization
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90129-2 · Cited by 5,818
Powell, M. J. D. (1964) · The Computer Journal · doi:10.1093/comjnl/7.2.155 · Cited by 4,632 · cited 13×
“13) is equivalent to the one that is used in Powell (1964).”
BackgroundMethodInfluentialSelf-citation`` Direct Search'' Solution of Numerical and Statistical Problems
Hooke, R., & Jeeves, T. A. (1961) · Journal of the ACM · doi:10.1145/321062.321069 · Cited by 4,254
Levary, R. R. (1982) · European Journal of Operational Research · doi:10.1016/0377-2217(82)90093-5 · Cited by 4,158
Practical Methods of Optimization.
Witzgall, C., & Fletcher, R. (1989) · Mathematics of Computation · doi:10.2307/2008742 · Cited by 3,591
Simulated annealing: theory and applications.
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90023-7 · Cited by 2,966
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
Algorithms for Minimization Without Derivatives
G., D., & Brent, R. P. (1974) · Mathematics of Computation · doi:10.2307/2005713 · Cited by 2,847
Simulated Annealing: Theory and Applications
van Laarhoven, P. J. M., & Aarts, E. H. L. (1987) · Springer eBooks · doi:10.1007/978-94-015-7744-1 · Cited by 2,385
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
Powell, M. J. D. (1994) · Advances in Optimization and Numerical Analysis · doi:10.1007/978-94-015-8330-5_4 · Cited by 1,369
Self-citationOn the Convergence of Pattern Search Algorithms
Torczon, V. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623493250780 · Cited by 1,336
Algorithms for minimization without derivatives
Anderson, D. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100629 · Cited by 1,209
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
On search directions for minimization algorithms
Powell, M. J. D. (1973) · Mathematical Programming · doi:10.1007/bf01584660 · Cited by 338
Self-citationAdvances in Optimization and Numerical Analysis
(1994) · Springer eBooks · doi:10.1007/978-94-015-8330-5 · Cited by 324
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
Recent progress in unconstrained nonlinear optimization without derivatives
Conn, A. R., Scheinberg, K., & Toint, P. L. (1997) · Mathematical Programming · doi:10.1007/bf02614326 · Cited by 255
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
On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
Lucidi, S., & Sciandrone, M. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623497330392 · Cited by 110
Griffiths, D. F., & Watson, G. A. (1996) · Cited by 70
A grid algorithm for bound constrained optimization of noisy functions
Elster, C., & Neumaier, A. (1995) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/15.4.585 · Cited by 60
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
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
UOBYQA: unconstrained optimization by quadratic approximation
Powell, M. J. D. (2002) · Mathematical Programming · doi:10.1007/s101070100290 · Cited by 352
Self-citationSystems biology: parameter estimation for biochemical models
Ashyraliyev, M., Fomekong‐Nanfack, Y., Kaandorp, J. A., & Blom, J. G. (2009) · The FEBS Journal · doi:10.1111/j.1742-4658.2008.06844.x · Cited by 323
Metadata
- Authors
- Powell, M. J. D.
- Venue
- Acta Numerica
- Publisher
- Cambridge University Press (CUP)
- Published
- 1998-01
- Volume
- 7
- Pages
- 287-336
- ISSN
- 0962-4929 (ISSN-L)
- 1474-0508
- OpenAlex
- W2079777091
- Cited by
- 558
- References
- 25
- FWCI
- 6.71
- 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.