A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
From MaRDI portal
Publication:2340521
DOI10.1007/s10589-014-9681-9zbMath1309.90072OpenAlexW2169988972MaRDI QIDQ2340521
Zheng Han, Frank E. Curtis, Daniel P. Robinson
Publication date: 20 April 2015
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-014-9681-9
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Quadratic programming (90C20) Numerical methods based on necessary conditions (49M05) Newton-type methods (49M15) Numerical methods for variational inequalities and related problems (65K15)
Related Items
A primal‐dual active‐set method for distributed model predictive control, Fundamentals of cone regression, Primal and dual active-set methods for convex quadratic programming, A dual active-set algorithm for regularized monotonic regression, A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem, A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds, A Reduced-Space Algorithm for Minimizing $\ell_1$-Regularized Convex Functions, A modified combined active-set Newton method for solving phase-field fracture into the monolithic limit, Total Variation Based Community Detection Using a Nonlinear Optimization Approach, 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 dual gradient-projection method for large-scale strictly convex quadratic problems, Matrix-free multigrid solvers for phase-field fracture problems, Quadratic maximization of reachable values of affine systems with diagonalizable matrix, A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs, Projection onto a Polyhedron that Exploits Sparsity, ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?, An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation, Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves, An exterior point polynomial-time algorithm for convex quadratic programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- qpOASES: a parametric active-set algorithm for~quadratic programming
- Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a \(P\)-matrix
- Block pivot methods for solving the complementarity problem
- An iterative two-step algorithm for linear complementarity problems
- Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
- Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
- Primal-dual strategy for state-constrained optimal control problems
- An iterative working-set method for large-scale nonconvex quadratic programming
- Support-vector networks
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- Application of the dual active set algorithm to quadratic network optimization
- Subspace Accelerated Matrix Splitting Algorithms for Asymmetric and Symmetric Linear Complementarity Problems
- A second-derivative SQP method with a 'trust-region-free' predictor step
- A Second Derivative SQP Method: Global Convergence
- A Second Derivative SQP Method: Local Convergence and Practical Issues
- 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
- Newton's method for linear complementarity problems
- A Feasible Active Set QP-Free Method for Nonlinear Programming
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- Primal-Dual Strategy for Constrained Optimal Control Problems
- A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
- An Infeasible Active Set Method for Quadratic Problems with Simple Bounds
- A repository of convex quadratic programming problems
- Trust Region Methods
- A Nonmonotone Line Search Technique for Newton’s Method
- A Statistical Model for Positron Emission Tomography
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
