Benchmarking optimization software with performance profiles.
From MaRDI portal
Publication:5957563
DOI10.1007/S101070100263zbMath1049.90004arXivcs/0102001OpenAlexW2149454052MaRDI QIDQ5957563
Jorge J. Moré, Elizabeth D. Dolan
Publication date: 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0102001
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)
Related Items (only showing first 100 items - show all)
A new two-step gradient-type method for large-scale unconstrained optimization ⋮ Spectral scaling BFGS method ⋮ Two modified HS type conjugate gradient methods for unconstrained optimization problems ⋮ A non-monotone line search algorithm for unconstrained optimization ⋮ Alternating direction augmented Lagrangian methods for semidefinite programming ⋮ A descent Dai-Liao conjugate gradient method based on a modified secant equation and its global convergence ⋮ Inexact restoration method for minimization problems arising in electronic structure calculations ⋮ Accurate matrix exponential computation to solve coupled differential models in engineering ⋮ Global convergence of a nonlinear conjugate gradient method ⋮ Orbital branching ⋮ An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem ⋮ An efficient nonmonotone trust-region method for unconstrained optimization ⋮ A new general form of conjugate gradient methods with guaranteed descent and strong global convergence properties ⋮ The constrained compartmentalized knapsack problem: mathematical models and solution methods ⋮ Models and algorithms to improve earthwork operations in road design using mixed integer linear programming ⋮ New quasi-Newton methods via higher order tensor models ⋮ Improved Hessian approximation with modified secant equations for symmetric rank-one method ⋮ A modified conjugate gradient algorithm with cyclic Barzilai-Borwein steplength for unconstrained optimization ⋮ Faster integer-feasibility in mixed-integer linear programs by branching to force change ⋮ Efficient orthogonal matrix polynomial based method for computing matrix exponential ⋮ Using approximate secant equations in limited memory methods for multilevel unconstrained optimization ⋮ Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization ⋮ How good are extrapolated bi-projection methods for linear feasibility problems? ⋮ \(n\)-step quadratic convergence of the MPRP method with a restart strategy ⋮ Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property ⋮ Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints ⋮ TRESNEI, a MATLAB trust-region solver for systems of nonlinear equalities and inequalities ⋮ Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms ⋮ A framework for scalable greedy coloring on distributed-memory parallel computers ⋮ Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization ⋮ Globally convergent modified Perry's conjugate gradient method ⋮ Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization ⋮ Global convergence of a spectral conjugate gradient method for unconstrained optimization ⋮ A combined class of self-scaling and modified quasi-Newton methods ⋮ An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization ⋮ Interior-point methods for nonconvex nonlinear programming: cubic regularization ⋮ On a method for constructing ensembles of regression models ⋮ Superlinearly convergent exact penalty methods with projected structured secant updates for constrained nonlinear least squares ⋮ An improved nonlinear conjugate gradient method with an optimal property ⋮ A variance-based method to rank input variables of the mesh adaptive direct search algorithm ⋮ Two modified three-term conjugate gradient methods with sufficient descent property ⋮ A modified DIRECT algorithm with bilevel partition ⋮ Study of a primal-dual algorithm for equality constrained minimization ⋮ Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization ⋮ A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares ⋮ Strong-branching inequalities for convex mixed integer nonlinear programs ⋮ Solving DC programs using the cutting angle method ⋮ Inexact restoration method for nonlinear optimization without derivatives ⋮ Globally convergent evolution strategies ⋮ Optimization of algorithms with OPAL ⋮ A reliable affine relaxation method for global optimization ⋮ A box-constrained differentiable penalty method for nonlinear complementarity problems ⋮ Scheduling with task replication on desktop grids: theoretical and experimental analysis ⋮ Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence ⋮ A nonmonotone line search method for noisy minimization ⋮ Conjugate gradient path method without line search technique for derivative-free unconstrained optimization ⋮ A trust-region approach with novel filter adaptive radius for system of nonlinear equations ⋮ Bounds tightening based on optimality conditions for nonconvex box-constrained optimization ⋮ A new approach based on the Newton's method to solve systems of nonlinear equations ⋮ Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method ⋮ A quasi-Newton algorithm for large-scale nonlinear equations ⋮ Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks ⋮ Multi-pattern generation framework for logical analysis of data ⋮ Maximizing a class of submodular utility functions with constraints ⋮ A limited memory descent Perry conjugate gradient method ⋮ On optimality of two adaptive choices for the parameter of Dai-Liao method ⋮ Regularized optimization methods for convex MINLP problems ⋮ An improved adaptive trust-region algorithm ⋮ On the multi-point Levenberg-Marquardt method for singular nonlinear equations ⋮ Supermemory gradient methods for monotone nonlinear equations with convex constraints ⋮ An inexact restoration derivative-free filter method for nonlinear programming ⋮ A new trust-region method for solving systems of equalities and inequalities ⋮ Preconditioning techniques based on the Birkhoff-von Neumann decomposition ⋮ An inexact proximal regularization method for unconstrained optimization ⋮ A variation on the interior point method for linear programming using the continued iteration ⋮ Three enhancements for optimization-based bound tightening ⋮ Improving the convergence rate of the DIRECT global optimization algorithm ⋮ Dai-Kou type conjugate gradient methods with a line search only using gradient ⋮ Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods ⋮ A class of adaptive dai-liao conjugate gradient methods based on the scaled memoryless BFGS update ⋮ Structured regularization for barrier NLP solvers ⋮ Partitioned quasi-Newton methods for sparse nonlinear equations ⋮ A nonmonotone Jacobian smoothing inexact Newton method for NCP ⋮ New multi-commodity flow formulations for the pooling problem ⋮ An adaptive competitive penalty method for nonsmooth constrained optimization ⋮ A modified three-term PRP conjugate gradient algorithm for optimization models ⋮ Computational optimization of gas compressor stations: MINLP models versus continuous reformulations ⋮ A modified three-term conjugate gradient method with sufficient descent property ⋮ Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results ⋮ Modified nonmonotone Armijo line search for descent method ⋮ A modified CG-DESCENT method for unconstrained optimization ⋮ A practical method for solving large-scale TRS ⋮ A global optimization method for the design of space trajectories ⋮ Sufficient descent directions in unconstrained optimization ⋮ Exploiting separability in large-scale linear support vector machine training ⋮ Applying powell's symmetrical technique to conjugate gradient methods ⋮ On the exact separation of mixed integer knapsack cuts ⋮ Combining and scaling descent and negative curvature directions ⋮ An augmented Lagrangian fish swarm based method for global optimization ⋮ A new globalization technique for nonlinear conjugate gradient methods for nonconvex minimization
Uses Software
This page was built for publication: Benchmarking optimization software with performance profiles.
