A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds
From MaRDI portal
Publication:2945124
DOI10.1137/140984439zbMath1329.90099OpenAlexW875426949MaRDI QIDQ2945124
Franz Rendl, Philipp Hungerländer
Publication date: 9 September 2015
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/9896669ea429db55eca3830ab9099e135573c003
Related Items
Convergence and adaptive discretization of the IRGNM Tikhonov and the IRGNM Ivanov method under a tangential cone condition in Banach space, A family of second-order methods for convex \(\ell _1\)-regularized optimization, Regularization of inverse problems via box constrained minimization, An index search method based inner-outer iterative algorithm for solving nonnegative least squares problems, Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization, Minimization Based Formulations of Inverse Problems and Their Regularization, Complexity and convergence certification of a block principal pivoting method for box-constrained quadratic programs, A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization, A second-order method for convex1-regularized optimization with active-set prediction, An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation
Uses Software
Cites Work
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a \(P\)-matrix
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Algorithms for bound constrained quadratic programming problems
- A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
- Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
- A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- A Comparison of a Moreau--Yosida-Based Active Set Strategy and Interior Point Methods for Constrained Optimal Control Problems
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- Primal-Dual Strategy for Constrained Optimal Control Problems
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
- An Infeasible Active Set Method for Quadratic Problems with Simple Bounds
- CUTEr and SifDec
- The conjugate gradient method in extremal problems
