Benchmarking optimization software with performance profiles.
From MaRDI portal
Publication:5957563
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.
Recommendations
Cited in
(only showing first 100 items - show all)- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- New nonlinear conjugate gradient methods based on optimal Dai-Liao parameters
- A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems
- A SemiSmooth Newton Method for Semidefinite Programs and its Applications in Electronic Structure Calculations
- An asynchronous bundle-trust-region method for dual decomposition of stochastic mixed-integer programming
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
- A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization
- A trust region subspace method for large-scale unconstrained optimization
- Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
- \(n\)-step quadratic convergence of the MPRP method with a restart strategy
- Another three-term conjugate gradient method close to the memoryless BFGS for large-scale unconstrained optimization problems
- A modified spectral conjugate gradient method with global convergence
- A class of derivative-free trust-region methods with interior backtracking technique for nonlinear optimization problems subject to linear inequality constraints
- A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations
- \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems
- A new filter QP-free method for the nonlinear inequality constrained optimization problem
- A trust-region method using extended nonmonotone technique for unconstrained optimization
- A double nonmonotone quasi-Newton method for nonlinear complementarity problem based on piecewise NCP functions
- A two-phase gradient method for quadratic programming problems with a single linear constraint and bounds on the variables
- A derivative-free approach to constrained multiobjective nonsmooth optimization
- An adaptive trust region method based on simple conic models
- Globally-biased disimpl algorithm for expensive global optimization
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- Derivative-Free Feasible Backtracking Search Methods for Nonlinear Multiobjective Optimization with Simple Boundary Constraint
- Nomonotone spectral gradient method for sparse recovery
- A derivative-free conjugate gradient method and its global convergence for solving symmetric nonlinear equations
- A derivative-free PRP method for solving large-scale nonlinear systems of equations and its global convergence
- A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
- Modified three-term Liu-Storey conjugate gradient method for solving unconstrained optimization problems and image restoration problems
- Computational study of a branching algorithm for the maximum \(k\)-cut problem
- A novel approach for solving semidefinite programs
- Multi-fidelity algorithms for the horizontal alignment problem in road design
- Gradient methods exploiting spectral properties
- Faster MIP solutions via new node selection rules
- A modified Hager-Zhang conjugate gradient method with optimal choices for solving monotone nonlinear equations
- A comparison of solution approaches for the numerical treatment of or-constrained optimization problems
- Two optimal Hager-Zhang conjugate gradient methods for solving monotone nonlinear equations
- A new conjugate gradient method with an efficient memory structure
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
- A Modified PRP Conjugate Gradient Algorithm with Trust Region for Optimization Problems
- A new cubic convergent method for solving a system of nonlinear equations
- Feasibility Pump-like heuristics for mixed integer problems
- A sequential quadratic programming algorithm for equality-constrained optimization without derivatives
- Proximal methods for nonlinear programming: Double regularization and inexact subproblems
- A trust-region-based derivative free algorithm for mixed integer programming
- Alternating cyclic vector extrapolation technique for accelerating nonlinear optimization algorithms and fixed-point mapping applications
- A preconditioned iterative interior point approach to the conic bundle subproblem
- On the stationarity for nonlinear optimization problems with polyhedral constraints
- On the centralization of the circumcentered-reflection method
- Hyperbolic smoothing function method for minimax problems
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
- IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming
- A scaled nonlinear conjugate gradient algorithm for unconstrained optimization
- A structured L-BFGS method and its application to inverse problems
- Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
- Benchmarking deterministic optimization algorithms using an outranking approach
- A modified conjugate gradient method based on the self-scaling memoryless BFGS update
- On efficiency of nonmonotone Armijo-type line searches
- A two-step improved Newton method to solve convex unconstrained optimization problems
- Model-based derivative-free methods for convex-constrained optimization
- An efficient adaptive trust-region method for systems of nonlinear equations
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
- Simultaneous Computational and Data Load Balancing in Distributed-Memory Setting
- An affine scaling method using a class of differential barrier functions: primal approach
- A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs
- A Structured Quasi-Newton Algorithm for Optimizing with Incomplete Hessian Information
- A new algorithm with structured diagonal Hessian approximation for solving nonlinear least squares problems and application to robotic motion control
- Relaxed-inertial derivative-free algorithm for systems of nonlinear pseudo-monotone equations
- A robust and efficient numerical finite element method for cables
- A globally convergent BFGS method with nonmonotone line search for non-convex minimization
- A framework for solving mixed-integer semidefinite programs
- FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
- A proximal neurodynamic model for a system of non-linear inverse mixed variational inequalities
- A modified Newton-secant method for solving nonsmooth generalized equations
- A new three-term conjugate gradient-based projection method for solving large-scale nonlinear monotone equations
- The hiking tourist problem
- A hybrid conjugate gradient method with descent property for unconstrained optimization
- Adaptive, limited-memory BFGS algorithms for unconstrained optimization
- A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization
- A regularized Newton method without line search for unconstrained optimization
- Integer programming solution approach for inventory‐production–distribution problems with direct shipments
- Sobolev seminorm of quadratic functions with applications to derivative-free optimization
- Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
- Three derivative-free projection methods for nonlinear equations with convex constraints
- Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search
- A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization
- A projection-based derivative free DFP approach for solving system of nonlinear convex constrained monotone equations with image restoration applications
- An accelerated nonmonotone trust region method with adaptive trust region for unconstrained optimization
- An adaptive scaled BFGS method for unconstrained optimization
- Exploiting damped techniques for nonlinear conjugate gradient methods
- Fast and accurate algorithm for the generalized exponential integral \(E_{\nu}(x)\) for positive real order
- Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming
- A nonmonotone weighting self-adaptive trust region algorithm for unconstrained nonconvex optimization
- The hybrid BFGS-CG method in solving unconstrained optimization problems
- A new method with sufficient descent property for unconstrained optimization
- A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems
Describes a project that uses
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)
