The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Benchmarking Derivative-Free Optimization Algorithms
Abstract
We propose data profiles as a tool for analyzing the performance of derivative-free optimization solvers when there are constraints on the computational budget. We use performance and data profiles, together with a convergence test that measures the decrease in function value, to analyze the performance of three solvers on sets of smooth, noisy, and piecewise-smooth problems. Our results provide estimates for the performance difference between these solvers, and show that on these problems, the model-based solver tested performs better than the two direct search solvers tested.
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
Benchmarking optimization software with performance profiles
Dolan, E. D., & Moré, J. J. (2002) · Mathematical Programming · doi:10.1007/s101070100263 · Cited by 4,412
Self-citationOptimization 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
Analysis of Generalized Pattern Searches
Audet, C., & Dennis, J. E. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623400378742 · Cited by 1,022
Gould, N. I. M., Orban, D., & Toint, P. L. (2003) · ACM Transactions on Mathematical Software · doi:10.1145/962437.962439 · Cited by 584
Ali, M. M., Khompatraporn, C., & Zabinsky, Z. B. (2005) · Journal of Global Optimization · doi:10.1007/s10898-004-9972-2 · Cited by 565
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
The NEWUOA software for unconstrained optimization without derivatives
Powell, M. J. D. (2006) · Nonconvex Optimization and Its Applications · doi:10.1007/0-387-30065-1_16 · Cited by 473
UOBYQA: unconstrained optimization by quadratic approximation
Powell, M. J. D. (2002) · Mathematical Programming · doi:10.1007/s101070100290 · Cited by 352
Conn, A. R., Scheinberg, K., & Vicente, L. N. (2009) · SIAM Journal on Optimization · doi:10.1137/060673424 · Cited by 213
An Implicit Filtering Algorithm for Optimization of Functions with Many Local Minima
Gilmore, P., & Kelley, C. T. (1995) · SIAM Journal on Optimization · doi:10.1137/0805015 · Cited by 171
Cited by
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
Benchmarking in Optimization: Best Practice and Open Issues
Bartz-Beielstein, T., Doerr, C., Berg, D. V. D., Bossek, J., Chandrasekaran, S., Eftimov, T., Fischbach, A., Kerschke, P., La Cava, W., Lopez-Ibanez, M., et al. (2020) · arXiv · doi:10.48550/arxiv.2007.03488 · Cited by 214
Performance of hybrid quantum-classical variational heuristics for combinatorial optimization
Nannicini, G. (2019) · Physical Review E · doi:10.1103/physreve.99.013304 · Cited by 138
“This normalization is also standard in the derivative-free optimization literature to account for varying problem sizes [18].”
BackgroundMethodEvolving objective function for improved variational quantum optimization
Kolotouros, I., & Wallden, P. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023225 · Cited by 24
Metadata
- Authors
- Moré, J. J., & Wild, S. M.
- Venue
- SIAM Journal on Optimization
- Published
- 2009-01
- Volume
- 20
- Issue
- 1
- Pages
- 172-191
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2057830724
- Cited by
- 573
- References
- 19
- FWCI
- 22.91
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Benchmarking Derivative-Free Optimization Algorithms. https://app.cochat.ai/papers/10.1137/080724083
- The paper
- Moré, J. J., & Wild, S. M. (2009). Benchmarking Derivative-Free Optimization Algorithms. SIAM Journal on Optimization. https://doi.org/10.1137/080724083
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.
