A note on performance profiles for benchmarking software
From MaRDI portal
Recommendations
Cites work
Cited in
(59)- Best practices for comparing optimization algorithms
- Evaluating bound-constrained minimization software
- Two--parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length
- Tighter McCormick relaxations through subgradient propagation
- 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
- An infeasible interior-point arc-search algorithm for nonlinear constrained optimization
- QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs
- On a primal-dual Newton proximal method for convex quadratic programs
- Bi-objective optimization for road vertical alignment design
- Outer approximation with conic certificates for mixed-integer convex problems
- A concurrent implementation of the surrogate management framework with application to cardiovascular shape optimization
- Benchmarking optimization software -- a (Hi)story
- PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
- A smoothing iterative method for the finite minimax problem
- A benchmarking system for MBS simulation software: problem standardization and performance measurement
- 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
- scientific article; zbMATH DE number 1706367 (Why is no real title available?)
- The performance profile: a multi-criteria performance evaluation method for test-based problems
- Reducing the influence of tiny normwise relative errors on performance profiles
- A server for automated performance analysis of benchmarking data
- \(LDL^T\) direction interior point method for semidefinite programming
- An adaptive nonmonotone trust region algorithm
- Conflict Analysis for MINLP
- Conflict-Driven Heuristics for Mixed Integer Programming
- A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
- On Fault-Tolerant Low-Diameter Clusters in Graphs
- Improving the Dai-Liao parameter choices using a fixed point equation
- A derivative-free algorithm for non-linear optimization with linear equality constraints
- Convergence of Newton-MR under inexact Hessian information
- A Globally Convergent SQCQP Method for Multiobjective Optimization Problems
- Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives
- A note on using performance and data profiles for training algorithms
- Optimality Measures for Performance Profiles
- A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization
- COCO: a platform for comparing continuous optimizers in a black-box setting
- Benchmarking optimization software with performance profiles.
- On atomic cliques in temporal graphs
- scientific article; zbMATH DE number 7771100 (Why is no real title available?)
- 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
- An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems
- Formulations and algorithms for the simple cycle problem
- Second-order methods for quartically-regularised cubic polynomials, with applications to high-order tensor methods
- An iteration method with relaxation parameter for solving ill-posed linear operator equations
- A trust region technique for multiobjective optimization problems with equality and inequality constraints
- Solving higher dimensional expensive black box global optimization problems using sparse directional search on surrogates
- A linear hybridization of the Hestenes-Stiefel method and the memoryless BFGS technique
- A speed up strategy for gradient methods
- A Homogeneous Tensor Framework for High-Order Trust-Region and Spherical Polynomial Optimization
- Extending a continuous RLT-based algorithm to mixed-integer polynomial problems
- A continuous approximation model for the electric vehicle fleet sizing problem
- OSQP: an operator splitting solver for quadratic programs
- Minotaur: a mixed-integer nonlinear optimization toolkit
This page was built for publication: A note on performance profiles for benchmarking software
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5270776)
