Pages that link to "Item:Q2340521"

The following pages link to A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization (Q2340521):

Displaying 16 items.

• Fundamentals of cone regression (Q289730) (← links)
• Primal and dual active-set methods for convex quadratic programming (Q312693) (← links)
• Complexity and convergence certification of a block principal pivoting method for box-constrained quadratic programs (Q1737602) (← links)
• A dual gradient-projection method for large-scale strictly convex quadratic problems (Q2012229) (← links)
• Matrix-free multigrid solvers for phase-field fracture problems (Q2021061) (← links)
• Quadratic maximization of reachable values of affine systems with diagonalizable matrix (Q2032024) (← links)
• 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 (Q2175368) (← links)
• A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
• ``Active-set complexity'' of proximal gradient: how long does it take to find the sparsity pattern? (Q2311100) (← links)
• An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
• A dual active-set algorithm for regularized monotonic regression (Q2397470) (← links)
• Projection onto a Polyhedron that Exploits Sparsity (Q2817841) (← links)
• Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves (Q2832889) (← links)
• A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds (Q2945124) (← links)
• A primal‐dual active‐set method for distributed model predictive control (Q5280135) (← links)
• A modified combined active-set Newton method for solving phase-field fracture into the monolithic limit (Q6171222) (← links)