Fetching the paper…
Reading the bibliography…
Comparing, or benchmarking, of optimization algorithms is a complicated task that involves many subtle considerations to yield a fair and unbiased evaluation.
Computational experience in solving linear programs
A. Hoffman, M. Mannos, D. Sokolowsky, and N. Wiegmann · 1953
Earlier work this paper cites.
A comparison of several current optimization methods, and the use of transformations in constrained problems
M. J. Box · 1966
Earlier work this paper cites.
A comparative study of nonlinear programming codes
A. R. Colville · 1968
Earlier work this paper cites.
A comparison of some recent iterative methods for the numerical solution of nonlinear programs
E. J. Beltrami · 1969
Earlier work this paper cites.
Comparative study of various minimization techniques used in mathematical programming
D. Tabak · 1969
Earlier work this paper cites.
Comparison of gradient methods for the solution of nonlinear parameter estimation problems
Y. Bard · 1970
Earlier work this paper cites.
Numerical experiments on quadratically convergent algorithms for function minimization
H. Y. Huang and A. V. Levy · 1970
Earlier work this paper cites.
Comparison of several gradient algorithms for mathematical programming problems
A. Miele, J. L. Tietze, and A. V. Levy · 1972
Earlier work this paper cites.
A computational comparison of some non-linear programs
J. Asaadi · 1973
Earlier work this paper cites.
A comparison of numerical optimization methods for engineering design
E. D. Eason and R. G. Fenton · 1974
Earlier work this paper cites.
A set of geometric programming test problems and their solutions
R. S. Dembo · 1976
Earlier work this paper cites.
Procedures for estimating optimal solution values for large combinatorial problems
D. G. Dannenbring · 1977
Earlier work this paper cites.
A simulation test approach to the evaluation of nonlinear optimization algorithms
K. E. Hillstrom · 1977
Earlier work this paper cites.
A comparison of some algorithms for the nonlinear least squares problem
H. Ramsin and P. Wedin · 1977
Earlier work this paper cites.
Exploratory data analysis
J. W. Tukey · 1977
Earlier work this paper cites.
Current state of the art of algorithms and computer software for geometric programming
R. S. Dembo · 1978
Earlier work this paper cites.
Towards global optimisation 2
L. C. W. Dixon and G. P. Szegö · 1978
Earlier work this paper cites.
Operating characteristics of some global search algorithms
V. A. Grishagin · 1978
Earlier work this paper cites.
Comparison of generalized geometric programming algorithms
M. J. Rijckaert and X. M. Martens · 1978
Earlier work this paper cites.
A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes
K. Schittkowski and J. Stoer · 1978
Earlier work this paper cites.
On reporting computational experiments with mathematical software
H. Crowder, R. S. Dembo, and J. M. Mulvey · 1979
Earlier work this paper cites.
Nonlinear programming codes: information, tests, performance
K. Schittkowski · 1980
Earlier work this paper cites.
The utility of nonlinear programming algorithms: A comparative study, part 1
E. Sandgren and K. M. Ragsdell · 1980
Earlier work this paper cites.
The utility of nonlinear programming algorithms: A comparative study, part 2
E. Sandgren and K. M. Ragsdell · 1980
Earlier work this paper cites.
Test examples for nonlinear programming codes
W. Hock and K. Schittkowski · 1981
Earlier work this paper cites.
Testing unconstrained optimization software
J. J. Moré, B. S. Garbow, and K. E. Hillstrom · 1981
Earlier work this paper cites.
Evidence of fundamental difficulties in nonlinear optimization code comparisons
E. D. Eason · 1982
Earlier work this paper cites.
Netgen-ii: A system for generating structured network-based mathematical programming test problems
J. J. Elam and D. Klingman · 1982
Earlier work this paper cites.
In pursuit of a methodology for testing mathematical programming software
K. L. Hoffman and R. H. F. Jackson · 1982
Earlier work this paper cites.
Evaluating Mathematical Programming Techniques
J. M. Mulvey, editor · 1982
Earlier work this paper cites.
A comparative performance evaluation of 27 nonlinear programming codes
W. Hock and K. Schittkowski · 1983
Earlier work this paper cites.
The visual display of quantitative information
E. R. Tufte and P. R. Graves-Morris · 1983
Earlier work this paper cites.
Randomly generated test problems for positive definite quadratic programming
M. L. Lenard and M. Minkoff · 1984
Earlier work this paper cites.
Using confidence limits for the global optimum in combinatorial optimization
U. Derigs · 1985
Earlier work this paper cites.
Numerical optimization techniques
Y. G. Evtushenko · 1985
Earlier work this paper cites.
The Traveling Salesman Problem: a guided tour of combinatorial optimization
B.L. Golden and W.R. Stewart · 1985
Earlier work this paper cites.
Testing strategies for simulation optimization
R. R. Barton · 1987
Earlier work this paper cites.
Performance of scientific software
E. N. Houstis, J. R. Rice, C. C. Christara, and E. A. Vavalis · 1988
Earlier work this paper cites.
Global optimization
A. Törn and A. Žilinskas · 1989
Earlier work this paper cites.
A collection of test problems for constrained global optimization algorithms
C. A. Floudas and P. M. Pardalos · 1990
Earlier work this paper cites.
Guidelines for reporting results of computational experiments. report of the ad hoc committee
R. H. F. Jackson, P. T. Boggs, S. G. Nash, and S. Powell · 1990
Earlier work this paper cites.
The MINPACK-2 test problem collection
B. M. Averick, R. G. Carter, and J. J. Moré · 1991
Earlier work this paper cites.
A numerical study of the limited memory BFGS method and the Truncated-Newton method for large scale optimization
S. Nash and J. Nocedal · 1991
Earlier work this paper cites.
Algorithm 709: Testing algorithm implementations
A. G. Buckley · 1992
Earlier work this paper cites.
Global optimization of univariate Lipschitz functions: Ii. new algorithms and computational comparison
P. Hansen, B. Jaumard, and S. H. Lu · 1992
Earlier work this paper cites.
Reporting computational experiments with parallel algorithms: Issues, measures, and experts’ opinions
R. S. Barr and B. L. Hickman · 1993
Earlier work this paper cites.
Convex analysis and minimization algorithms. II
J.-B. Hiriart-Urruty and C. Lemaréchal · 1993
Earlier work this paper cites.
A wide class of test functions for global optimization
F. Schoen · 1993
Earlier work this paper cites.
The Stanford GraphBase: a platform for combinatorial computing
D. E. Knuth · 1994
Earlier work this paper cites.
CUTE: Constrained and unconstrained testing environment
I. Bongartz, A. R. Conn, N. Gould, and P. L. Toint · 1995
Earlier work this paper cites.
Designing and reporting on computational experiments with heuristic methods
R. S. Barr, B. L. Golden, J. P. Kelly, M. G. C. Resende, and W. R. Stewart Jr · 1995
Cited alongside, same era.
Numerical experiments with the LANCELOT package (release A) for large-scale nonlinear optimization
A. R. Conn, N. Gould, and P. L. Toint · 1996
Cited alongside, same era.
Asymptotic experimental analysis for the Held-Karp traveling salesman bound
D. S. Johnson, L. A. McGeoch, and E. E. Rothberg · 1996
Cited alongside, same era.
The influence of caches on the performance of heaps
A. LaMarca and R. Ladner · 1996
Cited alongside, same era.
Toward an experimental method for algorithm simulation
C. C. McGeoch · 1996
Cited alongside, same era.
A numerical comparison between the LANCELOT and MINOS packages for large scale constrained optimization
An unconstrained optimization test functions collection
N. Andrei · 2008
Later among the works it cites.
Comparison of derivative-free optimization methods for groundwater supply and hydraulic capture community problems
K. R. Fowler, J. P. Reese, C. E. Kees, J. E. Dennis Jr., C. T. Kelley, C. T. Miller, C. Audet, A. J. Booker, G. Couture, R. W. Darwin, M. W. Farthing, D. E. Finkel, J. M. Gablonsky, G. Gray, and T. G. Kolda · 2008
Later among the works it cites.
An updated set of 306 test problems for nonlinear programming with validated optimal solutions - user’s guide
K. Schittkowski · 2008
Later among the works it cites.
Stochastic global optimization
A. Zhigljavsky and A. Žilinskas · 2008
Later among the works it cites.
Tuning Metaheuristics: A Machine Learning Perspective
M. Birattari · 2009
Later among the works it cites.
LIBOPT � an environment for testing solvers on heterogeneous collections of problems � the manual, version 2.1
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
I. Bongartz, A. R. Conn, N.I.M. Gould, M.A. Saunders, and P.L. Toint · 1997
Cited alongside, same era.
A comparison of large scale mixed complementarity problem solvers
S. C. Billups, S. P. Dirkse, and M. C. Ferris · 1997
Cited alongside, same era.
COPS: Large-scale nonlinearly constrained optimization problems
A. S. Bondarenko, D. M. Bortz, and J. J. Moré · 1999
Cited alongside, same era.
Handbook of Test Problems in Local and Global Optimization
C. A. Floudas, P. M. Pardalos, C. S. Adjiman, W. R. Esposito, Z. H. Gëmës, S. T. Harding, J. L. Klepeis, C. A. Meyer, and C. A. Schweiger · 1999
Cited alongside, same era.
Stochastic global optimization: Problem classes and solution techniques
A. Törn, M. M. Ali, and S. Viitanen · 1999
Cited alongside, same era.
An Interior-Point algorithm for nonconvex nonlinear programming
R. J. Vanderbei and D. F. Shanno · 1999
Cited alongside, same era.
Benchmarking optimization software with COPS
E. D. Dolan and J. J. Moré · 2000
Cited alongside, same era.
J. C. Gilbert and X. Jonsson · 2009
Later among the works it cites.
Combinatorial test problems and problem generators
D. Grundel and D. Jeffcoat · 2009
Later among the works it cites.
ParamILS: an automatic algorithm configuration framework
F. Hutter, H. H. Hoos, K. Leyton-Brown, and T. Stützle · 2009
Later among the works it cites.
Benchmarking derivative-free optimization algorithms
J. J. Moré and S. Wild · 2009
Later among the works it cites.
Algorithmic parameter optimization of the DFO method with the OPAL framework
C. Audet, C. K. Dang, and D. Orban · 2010
Later among the works it cites.
Experiment design and administration for computer clusters for SAT-solvers (EDACC), system description
A. Balint, D. Gall, G. Kapler, and R. Retz · 2010
Later among the works it cites.
Automated configuration of mixed integer programming solvers
F. Hutter, H. H. Hoos, and K. Leyton-Brown · 2010
Later among the works it cites.
A redistributed proximal bundle method for nonconvex optimization
W. Hare and C. Sagastizábal · 2010
Later among the works it cites.
Fairer benchmarking of optimization algorithms via derivative free optimization
W. L. Hare and Y Wang · 2010
Later among the works it cites.
Nuclear energy density optimization
M. Kortelainen, T. Lesinski, J. Moré, W. Nazarewicz, J. Sarich, N. Schunck, M. V. Stoitsov, and S. Wild · 2010
Later among the works it cites.
Tuning an algorithm using design of experiments
E. Ridge and D. Kudenko · 2010
Later among the works it cites.
Benchmarking multidisciplinary design optimization algorithms
N. P. Tedford and J. R. R.A. Martins · 2010
Later among the works it cites.
Models and algorithms to improve earthwork operations in road design using mixed integer linear programming
W. L. Hare, V. R. Koch, and Y. Lucet · 2011
Later among the works it cites.
MIPLIB 2010
T. Koch, T. Achterberg, E. Andersen, O. Bastert, T. Berthold, R. E. Bixby, E. Danna, G. Gamrath, A. M. Gleixner, S. Heinz, A. Lodi, H. Mittelmann, T. Ralphs, D. Salvagnin, D. E. Steffy, and K. Wolter · 2011
Later among the works it cites.
HAL: A framework for the automated analysis and design of high-performance algorithms
C. Nell, C. Fawcett, H. H. Hoos, and K. Leyton-Brown · 2011
Later among the works it cites.
Benchmarking procedures for continuous optimization algorithms
K. Opara and J. Arabas · 2011
Later among the works it cites.
Metaheuristic optimization frameworks: a survey and benchmarking
J. A. Parejo, A. Ruiz-Cortés, S. Lozano, and P. Fernandez · 2012
Later among the works it cites.
Algorithmic differentiation techniques for global optimization in the COCONUT environment
H. Schichl and M. C. Markót · 2012
Later among the works it cites.
Measuring the impact of primal heuristics
T. Berthold · 2013
Later among the works it cites.
A literature survey of benchmark functions for global optimisation problems
M. Jamil and X. S. Yang · 2013
Later among the works it cites.
Benchmarking nonlinear optimization software in technical computing environments
J. D. Pintér and F. J. Kampas · 2013
Later among the works it cites.
Derivative-free optimization: a review of algorithms and comparison of software implementations
L. Rios and N. V. Sahinidis · 2013
Later among the works it cites.
Introduction to global optimization exploiting space-filling curves
Y. D. Sergeyev, R. G. Strongin, and D. Lera · 2013
Later among the works it cites.
Optimization of algorithms with OPAL
C. Audet, K.-C. Dang, and D. Orban · 2014
Later among the works it cites.
Linear equalities in blackbox optimization
C. Audet, S. Le Digabel, and M. Peyrega · 2014
Later among the works it cites.
Experimental analysis of optimization algorithms: Tuning and beyond
T. Bartz-Beielstein and M. Preuss · 2014
Later among the works it cites.
PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
M. R. Bussieck, S. P. Dirkse, and S. Vigerske · 2014
Later among the works it cites.
Technical report, IBM Corporation, 2014
CPLEX’s automatic tuning tool · 2014
Later among the works it cites.
The optimization test environment
F. Domes, M. Fuchs, H. Schichl, and A. Neumaier · 2014
Later among the works it cites.
CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
N. M. Gould, D. Orban, and P. L. Toint · 2014
Later among the works it cites.
The NC-proximal average for multiple functions
W Hare and C Planiden · 2014
Later among the works it cites.
Test problem generator for unconstrained global optimization
C.-K. Ng and D. Li · 2014
Later among the works it cites.
Globally-biased Disimpl algorithm for expensive global optimization
R. Paulavičius, Y. D. Sergeyev, D. E. Kvasov, and J. Žilinskas · 2014
Later among the works it cites.
GAMS–a user’s guide
R. E. Rosenthal · 2014
Later among the works it cites.
Sobolev seminorm of quadratic functions with applications to derivative-free optimization
Z. Zhang · 2014
Later among the works it cites.
Multi-haul quasi network flow model for vertical alignment optimization
V. Beiranvand, W. Hare, Y. Lucet, and S. Hossain · 2015
Later among the works it cites.
Deterministic approaches for solving practical black-box global optimization problems
D. E. Kvasov and Y. D. Sergeyev · 2015
Later among the works it cites.
A deterministic global optimization using smooth diagonal auxiliary functions
Y. D. Sergeyev and D. E. Kvasov · 2015
Later among the works it cites.
A note on performance profiles for benchmarking software
N. Gould and J. Scott · 2016
Later among the works it cites.
One-dimensional global search: Nature-inspired vs. lipschitz methods
D. E. Kvasov and M. S. Mukhametzhanov · 2016
Later among the works it cites.
Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms
Y. D. Sergeyev, D. E. Kvasov, and M. S. Mukhametzhanov · 2016
Later among the works it cites.
Lipschitz optimization methods for fitting a sum of damped sinusoids to a series of observations
J. W. Gillard and D. E. Kvasov · 2017
Closest in time.
Metaheuristic vs. deterministic global optimization algorithms: The univariate case
D. E. Kvasov and M. S. Mukhametzhanov · 2017
Closest in time.
CONORBIT: constrained optimization by radial basis function interpolation in trust regions
R. G. Regis and S. M. Wild · 2017
Closest in time.