A Solver for Nonconvex Bound-Constrained Quadratic Optimization

DOI10.1137/15M1022100zbMath1330.49029OpenAlexW2200352289MaRDI QIDQ3454512

Daniel P. Robinson, Hassan Mohy-Ud-Din

Publication date: 25 November 2015

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/15m1022100

zbMATH Keywords

active setsconjugate gradient iterationactive variablesnonconvex bound-constrained quadratic optimization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Newton-type methods (49M15) Numerical computation of solutions to systems of equations (65H10) Numerical methods based on nonlinear programming (49M37) Implicit function theorems; global Newton methods on manifolds (58C15)

Related Items

A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions, On the stationarity for nonlinear optimization problems with polyhedral constraints, Exploiting negative curvature in deterministic and stochastic optimization, A subspace-accelerated split Bregman method for sparse data recovery with joint \(\ell_1\)-type regularizers, A dual gradient-projection method for large-scale strictly convex quadratic problems, A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables

Uses Software

• L-BFGS-B
• L-BFGS
• PENNON
• LBFGS-B
• CUTEst

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal quadratic programming algorithms. With applications to variational inequalities
• An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems
• Algorithms for bound constrained quadratic programming problems
• Une caractérisation complete des minima locaux en programmation quadratique
• A class of methods for solving large, convex quadratic programs subject to box constraints
• An iterative two-step algorithm for linear complementarity problems
• A proportioning based algorithm with rate of convergence for bound constrained quadratic programming
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
• Nonmonotone strategy for minimization of quadratics with simple constraints.
• Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
• CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
• Adaptive augmented Lagrangian methods: algorithms and practical numerical experience
• Subspace Accelerated Matrix Splitting Algorithms for Asymmetric and Symmetric Linear Complementarity Problems
• On the solution of complementarity problems arising in American options pricing
• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• Numerical Simulation of Time-Dependent Contact and Friction Problems in Rigid Body Mechanics
• On Augmented Lagrangian Methods with General Lower-Level Constraints
• The Free Boundary for Elastic-Plastic Torsion Problems
• On the Identification of Local Minimizers in Inertia-Controlling Methods for Quadratic Programming
• On the Solution of Large Quadratic Programming Problems with Bound Constraints
• Algorithm 778: L-BFGS-B
• On the Maximization of a Concave Quadratic Function with Box Constraints
• Box Constrained Quadratic Programming with Proportioning and Projections
• PENNON: A code for convex nonlinear and semidefinite programming
• Trust Region Methods
• On the numerical solution of bound constrained optimization problems
• Projected Newton Methods for Optimization Problems with Simple Constraints
• Convex programming in Hilbert space
• Methods of conjugate gradients for solving linear systems