The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Benchmarking optimization software with performance profiles
Open accessAbstract
We propose performance profiles — distribution functions for a performance metric — as a tool for benchmarking and comparing optimization software. We show that performance profiles combine the best features of other tools for performance evaluation.
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
Accuracy and Stability of Numerical Algorithms: Second Edition
Higham, N. J. (2002) · doi:10.1137/1.9780898718027 · Cited by 3,803
AMPL : a modeling language for mathematical programming
Fourer, R., & Kernighan, B. W. (1993) · Cited by 1,860
An Interior-Point Algorithm for Nonconvex Nonlinear Programming
Vanderbei, R. J., & Shanno, D. F. (1999) · Computational Optimization and Applications · doi:10.1023/a:1008677427361 · Cited by 526
Nash, S. G., & Nocedal, J. (1991) · SIAM Journal on Optimization · doi:10.1137/0801023 · Cited by 217
On Reporting Computational Experiments with Mathematical Software
Crowder, H. P., Dembo, R. S., & Mulvey, J. M. (1979) · ACM Transactions on Mathematical Software · doi:10.1145/355826.355833 · Cited by 83
Numerical experiments with the LANCELOT package (release A) for large-scale nonlinear optimization
Conn, A. R., Gould, N. I. M., & Toint, P. L. (1996) · Mathematical Programming · doi:10.1007/bf02592099 · Cited by 53
Cited by
Wächter, A., & Biegler, L. T. (2006) · Mathematical Programming · doi:10.1007/s10107-004-0559-y · Cited by 9,483
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Gill, P. E., Murray, W., & Saunders, M. A. (2005) · SIAM Review · doi:10.1137/s0036144504446096 · Cited by 2,834
Direct Methods for Sparse Matrices
Duff, I. S., Erisman, A. M., & Reid, J. K. (2017) · doi:10.1093/acprof:oso/9780198508380.001.0001 · Cited by 1,604
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Gill, P. E., Murray, W., & Saunders, M. A. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623499350013 · Cited by 1,587
OSQP: an operator splitting solver for quadratic programs
Stellato, B., Banjac, G., Goulart, P., Bemporad, A., & Boyd, S. (2020) · Mathematical Programming Computation · doi:10.1007/s12532-020-00179-2 · Cited by 1,213
SCIP: solving constraint integer programs
Achterberg, T. (2009) · Mathematical Programming Computation · doi:10.1007/s12532-008-0001-1 · Cited by 1,167
Compressed Sensing Off the Grid
Tang, G., Bhaskar, B. N., Shah, P., & Recht, B. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2277451 · Cited by 1,163
An interior algorithm for nonlinear optimization that combines line search and trust region steps
Waltz, R. A., Morales, J. L., Nocedal, J., & Orban, D. (2006) · Mathematical Programming · doi:10.1007/s10107-004-0560-5 · Cited by 1,057
An algorithmic framework for convex mixed integer nonlinear programs
Bonami, P., Biegler, L. T., Conn, A. R., Cornuéjols, G., Grossmann, I. E., Laird, C. D., Lee, J., Lodi, A., Margot, F., Sawaya, N., et al. (2008) · Discrete Optimization · doi:10.1016/j.disopt.2006.10.011 · Cited by 902
Mixed-integer nonlinear optimization
Belotti, P., Kirches, C., Leyffer, S., Linderoth, J., Luedtke, J., & Mahajan, A. (2013) · Acta Numerica · doi:10.1017/s0962492913000032 · Cited by 712
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
A comparison of algorithms for maximum entropy parameter estimation
Malouf, R. (2002) · proceeding of the 6th conference on Natural language learning - COLING-02 · doi:10.3115/1118853.1118871 · Cited by 655
Atomic Norm Denoising With Applications to Line Spectral Estimation
Bhaskar, B. N., Tang, G., & Recht, B. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2273443 · Cited by 579
Benchmarking Derivative-Free Optimization Algorithms
Moré, J. J., & Wild, S. M. (2009) · SIAM Journal on Optimization · doi:10.1137/080724083 · Cited by 573
Self-citationAli, M. M., Khompatraporn, C., & Zabinsky, Z. B. (2005) · Journal of Global Optimization · doi:10.1007/s10898-004-9972-2 · Cited by 565
The Scaling and Squaring Method for the Matrix Exponential Revisited
Higham, N. J. (2005) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/04061101x · Cited by 538
ANTIGONE: Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations
Misener, R., & Floudas, C. A. (2014) · Journal of Global Optimization · doi:10.1007/s10898-014-0166-2 · Cited by 505
Simulation optimization: a review of algorithms and applications
Amaran, S., Sahinidis, N. V., Sharda, B., & Bury, S. J. (2016) · Annals of Operations Research · doi:10.1007/s10479-015-2019-x · Cited by 467
Complete search in continuous global optimization and constraint satisfaction
Neumaier, A. (2004) · Acta Numerica · doi:10.1017/s0962492904000194 · Cited by 430
COCO: a platform for comparing continuous optimizers in a black-box setting
Hansen, N., Auger, A., Ros, R., Mersmann, O., Tušar, T., & Brockhoff, D. (2021) · Optimization Methods and Software · doi:10.1080/10556788.2020.1808977 · Cited by 408
Direct Multisearch for Multiobjective Optimization
Custódio, A. L., Madeira, J. F. A., Vaz, A. I. F., & Vicente, L. N. (2011) · SIAM Journal on Optimization · doi:10.1137/10079731x · Cited by 392
Alternating direction augmented Lagrangian methods for semidefinite programming
Wen, Z., Goldfarb, D., & Yin, W. (2010) · Mathematical Programming Computation · doi:10.1007/s12532-010-0017-1 · Cited by 359
MIPLIB 2010: Mixed Integer Programming Library version 5
Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R. E., Danna, E., Gamrath, G., Gleixner, A. M., Heinz, S., et al. (2011) · Mathematical Programming Computation · doi:10.1007/s12532-011-0025-9 · Cited by 321
A particle swarm pattern search method for bound constrained global optimization
Vaz, A. I. F., & Vicente, L. N. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9133-5 · Cited by 316
A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
Dai, Y.-H., & Kou, C.-X. (2013) · SIAM Journal on Optimization · doi:10.1137/100813026 · Cited by 308
Parallel stochastic gradient algorithms for large-scale matrix completion
Recht, B., & Ré, C. (2013) · Mathematical Programming Computation · doi:10.1007/s12532-013-0053-8 · Cited by 300
Performance assessment of the metaheuristic optimization algorithms: an exhaustive review
Halim, A. H., Ismail, I., & Das, S. (2021) · Artificial Intelligence Review · doi:10.1007/s10462-020-09906-6 · Cited by 293
Zhang, L., Zhou, W., & Li, D. (2006) · Numerische Mathematik · doi:10.1007/s00211-006-0028-z · Cited by 292
Wen, Z., Yin, W., Goldfarb, D., & Zhang, Y. (2010) · SIAM Journal on Scientific Computing · doi:10.1137/090747695 · Cited by 280
Sorber, L., Van Barel, M., & De Lathauwer, L. (2013) · SIAM Journal on Optimization · doi:10.1137/120868323 · Cited by 273
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
Deep Reinforcement Learning at the Edge of the Statistical Precipice
Agarwal, R., Schwarzer, M., Castro, P. S., Courville, A., & Bellemare, M. G. (2021) · arXiv · doi:10.48550/arxiv.2108.13264 · Cited by 142
Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems
Gschwind, T., Irnich, S., Rothenbächer, A.-K., & Tilk, C. (2018) · European Journal of Operational Research · doi:10.1016/j.ejor.2017.09.035 · Cited by 48
MLGym: A New Framework and Benchmark for Advancing AI Research Agents
Nathani, D., Madaan, L., Roberts, N., Bashlykov, N., Menon, A., Moens, V., Budhiraja, A., Magka, D., Vorotilov, V., Chaurasia, G., et al. (2025) · arXiv · doi:10.48550/arxiv.2502.14499 · Cited by 15
Metadata
- Authors
- Dolan, E. D., & Moré, J. J.
- Venue
- Mathematical Programming
- Published
- 2002-01-01
- Volume
- 91
- Issue
- 2
- Pages
- 201-213
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2149454052
- Cited by
- 4,412
- References
- 6
- FWCI
- 30.90
- 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.