The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Recent progress in unconstrained nonlinear optimization without derivatives
Open accessAbstract
We present an introduction to a new class of derivative free methods for unconstrained optimization. We start by discussing the motivation for such methods and why they are in high demand by practitioners. We then review the past developments in this field, before introducing the features that characterize the newer algorithms. In the context of a trust region framework, we focus on techniques that ensure a suitable “geometric quality” of the considered models. We then outline the class of algorithms based on these techniques, as well as their respective merits. We finally conclude the paper with a discussion of open questions and perspectives.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Dennis, J. E., & Schnabel, R. B. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971200 · Cited by 7,615
Powell, M. J. D. (1964) · The Computer Journal · doi:10.1093/comjnl/7.2.155 · Cited by 4,632 · cited 2×
“In [19], Powell described a method for solving the nonlinear unconstrained minimization problem based on the use of conjugate directions.”
Method`` 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
Algorithms for Minimization Without Derivatives
G., D., & Brent, R. P. (1974) · Mathematics of Computation · doi:10.2307/2005713 · Cited by 2,847
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
On the Convergence of Pattern Search Algorithms
Torczon, V. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623493250780 · Cited by 1,336
Approximation Theory and Methods.
Wahlbin, L. B., & Powell, M. J. D. (1982) · Mathematics of Computation · doi:10.2307/2007351 · Cited by 805
Bongartz, I., Conn, A. R., Gould, N. I. M., & Toint, P. L. (1995) · ACM Transactions on Mathematical Software · doi:10.1145/200979.201043 · Cited by 784
Self-citation
Cited by
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
Derivative-free optimization: a review of algorithms and comparison of software implementations
Rios, L. M., & Sahinidis, N. V. (2013) · Journal of Global Optimization · doi:10.1007/s10898-012-9951-y · Cited by 1,276
Advances in surrogate based modeling, feasibility analysis, and optimization: A review
Bhosekar, A., & Ierapetritou, M. (2018) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2017.09.017 · Cited by 707
Memetic algorithms and memetic computing optimization: A literature review
Neri, F., & Cotta, C. (2012) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.11.003 · Cited by 680
Biegler, L. T., & Grossmann, I. E. (2004) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2003.11.003 · Cited by 593
Direct search algorithms for optimization calculations
Powell, M. J. D. (1998) · Acta Numerica · doi:10.1017/s0962492900002841 · Cited by 558
A Stochastic Radial Basis Function Method for the Global Optimization of Expensive Functions
Regis, R. G., & Shoemaker, C. A. (2007) · INFORMS Journal on Computing · doi:10.1287/ijoc.1060.0182 · Cited by 528
Lougee-Heimer, R. (2003) · IBM Journal of Research and Development · doi:10.1147/rd.471.0057 · Cited by 383
Derivative-free optimization methods
Larson, J., Menickelly, M., & Wild, S. M. (2019) · Acta Numerica · doi:10.1017/s0962492919000060 · Cited by 381
Cooperative Control of Distributed Multi‐Agent Systems
(2007) · Wiley eBooks · doi:10.1002/9780470724200 · Cited by 361
UOBYQA: unconstrained optimization by quadratic approximation
Powell, M. J. D. (2002) · Mathematical Programming · doi:10.1007/s101070100290 · Cited by 352
Constrained Global Optimization of Expensive Black Box Functions Using Radial Basis Functions
Regis, R. G., & Shoemaker, C. A. (2005) · Journal of Global Optimization · doi:10.1007/s10898-004-0570-0 · Cited by 331
Recent advances in trust region algorithms
Yuan, Y.-X. (2015) · Mathematical Programming · doi:10.1007/s10107-015-0893-2 · Cited by 314
SNOBFIT -- Stable Noisy Optimization by Branch and Fit
Huyer, W., & Neumaier, A. (2008) · ACM Transactions on Mathematical Software · doi:10.1145/1377612.1377613 · Cited by 262
Metadata
- Authors
- Conn, A. R., Scheinberg, K., & Toint, P. L.
- Venue
- Mathematical Programming
- Published
- 1997-10
- Volume
- 79
- Issue
- 1-3
- Pages
- 397-414
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W1966878414
- Cited by
- 255
- References
- 24
- FWCI
- 2.06
- Type
- journal article
- Language
- en
- Open access
- green
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.