A Note on Performance Profiles for Benchmarking Software
From MaRDI portal
Publication:5270776
DOI10.1145/2950048zbMath1369.65202OpenAlexW2518523798WikidataQ113310157 ScholiaQ113310157MaRDI QIDQ5270776
Jennifer Scott, Nicholas I. M. Gould
Publication date: 30 June 2017
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://centaur.reading.ac.uk/74694/1/perform_toms.pdf
Related Items (40)
Minotaur: a mixed-integer nonlinear optimization toolkit ⋮ A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem ⋮ Bi-objective optimization for road vertical alignment design ⋮ On Fault-Tolerant Low-Diameter Clusters in Graphs ⋮ Best practices for comparing optimization algorithms ⋮ On atomic cliques in temporal graphs ⋮ Optimization by moving ridge functions: derivative-free optimization for computationally intensive functions ⋮ Performance enhancements for a generic conic interior point algorithm ⋮ Revisiting degeneracy, strict feasibility, stability, in linear programming ⋮ Newton-MR: inexact Newton method with minimum residual sub-problem solver ⋮ A derivative-free algorithm for non-linear optimization with linear equality constraints ⋮ Outer approximation with conic certificates for mixed-integer convex problems ⋮ In-depth analysis of granular local search for capacitated vehicle routing ⋮ Computational advances in polynomial optimization: RAPOSa, a freely available global solver ⋮ On FISTA with a relative error rule ⋮ $LDL^T$ Direction Interior Point Method for Semidefinite Programming ⋮ Unnamed Item ⋮ A concurrent implementation of the surrogate management framework with application to cardiovascular shape optimization ⋮ An adaptive nonmonotone trust region algorithm ⋮ Benchmarking optimization software -- a (Hi)story ⋮ Convergence of Newton-MR under Inexact Hessian Information ⋮ A Globally Convergent SQCQP Method for Multiobjective Optimization Problems ⋮ Improving the Dai-Liao parameter choices using a fixed point equation ⋮ Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives ⋮ Two--parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length ⋮ OSQP: An Operator Splitting Solver for Quadratic Programs ⋮ Tighter McCormick relaxations through subgradient propagation ⋮ An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems ⋮ A linear hybridization of the Hestenes-Stiefel method and the memoryless BFGS technique ⋮ DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization ⋮ Linearization of McCormick relaxations and hybridization with the auxiliary variable method ⋮ A sequential quadratic programming method for constrained multi-objective optimization problems ⋮ A smoothing iterative method for the finite minimax problem ⋮ An infeasible interior-point arc-search algorithm for nonlinear constrained optimization ⋮ Conflict Analysis for MINLP ⋮ Conflict-Driven Heuristics for Mixed Integer Programming ⋮ QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs ⋮ A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization ⋮ COCO: a platform for comparing continuous optimizers in a black-box setting ⋮ On a primal-dual Newton proximal method for convex quadratic programs
Uses Software
Cites Work
This page was built for publication: A Note on Performance Profiles for Benchmarking Software
