A solver for nonconvex bound-constrained quadratic optimization
DOI10.1137/15M1022100zbMATH Open1330.49029OpenAlexW2200352289MaRDI QIDQ3454512FDOQ3454512
Authors: Hassan Mohy-Ud-Din, Daniel P. Robinson 
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
Recommendations
- A new bound-and-reduce approach of nonconvex quadratic programming problems
- A global optimization approach for quadratic programs with nonconvex quadratic constraints
- A branch and bound algorithm for nonconvex quadratic programming with quadratic constraints
- A flexible iterative solver for nonconvex, equality-constrained quadratic subproblems
- Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems
active setsconjugate gradient iterationactive variablesnonconvex bound-constrained quadratic optimization
Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Abstract computational complexity for mathematical programming problems (90C60) Numerical computation of solutions to systems of equations (65H10) Newton-type methods (49M15) Implicit function theorems; global Newton methods on manifolds (58C15)
Cites Work
- Algorithm 778: L-BFGS-B
- PENNON: A code for convex nonlinear and semidefinite programming
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Methods of conjugate gradients for solving linear systems
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Trust Region Methods
- Convex programming in Hilbert space
- Title not available (Why is that?)
- Algorithms for bound constrained quadratic programming problems
- Title not available (Why is that?)
- Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
- On the Maximization of a Concave Quadratic Function with Box Constraints
- Box Constrained Quadratic Programming with Proportioning and Projections
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Optimal quadratic programming algorithms. With applications to variational inequalities
- Nonmonotone strategy for minimization of quadratics with simple constraints.
- A class of methods for solving large, convex quadratic programs subject to box constraints
- A proportioning based algorithm with rate of convergence for bound constrained quadratic programming
- Subspace accelerated matrix splitting algorithms for asymmetric and symmetric linear complementarity problems
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- Title not available (Why is that?)
- Une caractérisation complete des minima locaux en programmation quadratique
- On the Identification of Local Minimizers in Inertia-Controlling Methods for Quadratic Programming
- An iterative two-step algorithm for linear complementarity problems
- On the solution of complementarity problems arising in American options pricing
- The Free Boundary for Elastic-Plastic Torsion Problems
- Numerical Simulation of Time-Dependent Contact and Friction Problems in Rigid Body Mechanics
- An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems
- On the numerical solution of bound constrained optimization problems
- Adaptive augmented Lagrangian methods: algorithms and practical numerical experience
- Title not available (Why is that?)
Cited In (13)
- Exploiting negative curvature in deterministic and stochastic optimization
- Solving nearly-separable quadratic optimization problems as nonsmooth equations
- The bound-constrained conjugate gradient method for non-negative matrices
- Computational methods for solving nonconvex block-separable constrained quadratic problems
- A non-interior path following method for convex quadratic programming problems with bound constraints
- A flexible iterative solver for nonconvex, equality-constrained quadratic subproblems
- Nonmonotone strategy for minimization of quadratics with simple constraints.
- An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints.
- A reduced-space algorithm for minimizing \(\ell_1\)-regularized convex functions
- 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
- On the stationarity for nonlinear optimization problems with polyhedral constraints
Uses Software
This page was built for publication: A solver for nonconvex bound-constrained quadratic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454512)
