Benchmarking optimization software with performance profiles.
From MaRDI portal
Publication:5957563
DOI10.1007/S101070100263zbMATH Open1049.90004arXivcs/0102001OpenAlexW2149454052MaRDI QIDQ5957563FDOQ5957563
Authors: Elizabeth D. Dolan, Jorge J. Moré 
Publication date: 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Abstract: 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.
Full work available at URL: https://arxiv.org/abs/cs/0102001
Recommendations
Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Cited In (only showing first 100 items - show all)
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- Nomonotone spectral gradient method for sparse recovery
- PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
- FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming
- A note on performance profiles for benchmarking software
- Optimal subgradient methods: computational properties for large-scale linear inverse problems
- Hybrid Riemannian conjugate gradient methods with global convergence properties
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
- MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
- Solving linear programs with complementarity constraints using branch-and-cut
- A trust-region method with improved adaptive radius for systems of nonlinear equations
- A doubly stabilized bundle method for nonsmooth convex optimization
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
- Towards an objective feasibility pump for convex minlps
- Optimization strategies for two-mode partitioning
- A globally convergent penalty-free method for optimization with equality constraints and simple bounds
- Spectral method and its application to the conjugate gradient method
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- The optimization test environment
- Exploiting separability in large-scale linear support vector machine training
- Comparative study of RPSALG algorithm for convex semi-infinite programming
- A BFGS trust-region method for nonlinear equations
- A new generalized shrinkage conjugate gradient method for sparse recovery
- A conjugate gradient method with descent direction for unconstrained optimization
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- An algorithmic framework for convex mixed integer nonlinear programs
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems
- Solving bilevel linear programs using multiple objective linear programming
- A modified PRP conjugate gradient method
- BFGS trust-region method for symmetric nonlinear equations
- Parallel stochastic gradient algorithms for large-scale matrix completion
- An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
- A new adaptive trust-region method for system of nonlinear equations
- A modified Hestenes-Stiefel conjugate gradient algorithm for large-scale optimization
- Nonmonotone spectral method for large-scale symmetric nonlinear equations
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Globally convergent DC trust-region methods
- Primal convergence from dual subgradient methods for convex optimization
- Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- A new method for solving second-order cone eigenvalue complementarity problems
- Another hybrid conjugate gradient algorithm for unconstrained optimization
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- FiberSCIP—A Shared Memory Parallelization of SCIP
- A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
- A new method for solving Pareto eigenvalue complementarity problems
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
- New limited memory bundle method for large-scale nonsmooth optimization
- Measuring the impact of primal heuristics
- A particle swarm pattern search method for bound constrained global optimization
- A trust-region SQP method without a penalty or a filter for nonlinear programming
- GLOMIQO: global mixed-integer quadratic optimizer
- OSQP: an operator splitting solver for quadratic programs
- TRESNEI, a MATLAB trust-region solver for systems of nonlinear equalities and inequalities
- Two globally convergent nonmonotone trust-region methods for unconstrained optimization
- Comparing different nonsmooth minimization methods and software
- CONORBIT: constrained optimization by radial basis function interpolation in trust regions
- The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
- Optimization of algorithms with OPAL
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
- An effective trust-region-based approach for symmetric nonlinear systems
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Rank reduction of correlation matrices by majorization
- SCIP: solving constraint integer programs
- COCO: a platform for comparing continuous optimizers in a black-box setting
- Minotaur: a mixed-integer nonlinear optimization toolkit
- On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
- Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
- A first-order block-decomposition method for solving two-easy-block structured semidefinite programs
- A new three-term conjugate gradient algorithm for unconstrained optimization
- Inexact restoration method for minimization problems arising in electronic structure calculations
- Symmetric Perry conjugate gradient method
- Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
- A Two-Term PRP-Based Descent Method
- Some descent three-term conjugate gradient methods and their global convergence
- Extended formulations in mixed integer conic quadratic programming
- An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix
- Customizing the solution process of COIN-OR's linear solvers with python
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
- MAKHA -- a new hybrid swarm intelligence global optimization algorithm
- Constrained dogleg methods for nonlinear systems with simple bounds
- \texttt{HSL\_MI28}: an efficient and robust limited-memory incomplete Cholesky factorization code
- Algorithm 943: MSS: MATLAB software for L-BFGS trust-region subproblems for large-scale optimization
- On the simplex algorithm initializing
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
- \texttt{trlib}: a vector-free implementation of the GLTR method for iterative solution of the trust region problem
- Efficient rank reduction of correlation matrices
- A simplicial homology algorithm for Lipschitz optimisation
- A BFGS algorithm for solving symmetric nonlinear equations
- An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints
- A multi-objective \textbf{DIRECT} algorithm for ship hull optimization
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
- A derivative-free approach to constrained multiobjective nonsmooth optimization
Uses Software
This page was built for publication: Benchmarking optimization software with performance profiles.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957563)
