A feasible active set method for strictly convex quadratic problems with simple bounds
From MaRDI portal
Publication:2945124
DOI10.1137/140984439zbMATH Open1329.90099OpenAlexW875426949MaRDI QIDQ2945124FDOQ2945124
Authors: Philipp Hungerländer, Franz Rendl 
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
Recommendations
- An Infeasible Active Set Method for Quadratic Problems with Simple Bounds
- Primal and dual active-set methods for convex quadratic programming
- A numerically stable dual method for solving strictly convex quadratic programs
- scientific article; zbMATH DE number 3982419
- On active-set methods for the quadratic programming problem
Cites Work
- CUTEr and SifDec
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- The conjugate gradient method in extremal problems
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- Primal-Dual Strategy for Constrained Optimal Control Problems
- Algorithms for bound constrained quadratic programming problems
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
- A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
- Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
- A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
- An Infeasible Active Set Method for Quadratic Problems with Simple Bounds
- Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a \(P\)-matrix
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- A comparison of a Moreau-Yosida-based active set strategy and interior point methods for constrained optimal control problems
Cited In (16)
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- Convergence and adaptive discretization of the IRGNM Tikhonov and the IRGNM Ivanov method under a tangential cone condition in Banach space
- Improved convergence rates for Lasserre-type hierarchies of upper bounds for box-constrained polynomial optimization
- 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 random active set method for strictly convex quadratic problem with simple bounds
- An Infeasible Active Set Method for Quadratic Problems with Simple Bounds
- A second-order method for convex \(\ell_1\)-regularized optimization with active-set prediction
- Exact Complexity Certification of Active-Set Methods for Quadratic Programming
- Primal and dual active-set methods for convex quadratic programming
- Regularization of inverse problems via box constrained minimization
- An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation
- An index search method based inner-outer iterative algorithm for solving nonnegative least squares problems
- A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
- Minimization Based Formulations of Inverse Problems and Their Regularization
- Title not available (Why is that?)
Uses Software
This page was built for publication: A feasible active set method for strictly convex quadratic problems with simple bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945124)
