QPSchur

swMATH6918MaRDI QIDQ18984FDOQ18984

Author name not available (Why is that?)

Described by source

• QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming

Cited In (16)

• Complexity and convergence certification of a block principal pivoting method for box-constrained quadratic programs
• Recent advances in quadratic programming algorithms for nonlinear model predictive control
• Globally convergent primal-dual active-set methods with inexact subproblem solves
• Primal and dual active-set methods for convex quadratic programming
• Block-structured quadratic programming for the direct multiple shooting method for optimal control
• Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems
• An Active-Set Method for Quadratic Programming Based On Sequential Hot-Starts
• Dual support method for solving convex quadratic programs
• A Dual Active-Set Solver for Embedded Quadratic Programming Using Recursive LDL$^{T}$ Updates
• qpOASES: a parametric active-set algorithm for~quadratic programming
• A global piecewise smooth Newton method for fast large-scale model predictive control
• An exterior point polynomial-time algorithm for convex quadratic programming
• Methods for convex and general quadratic programming
• Optimal sensitivity based on IPOPT
• A factorization with update procedures for a KKT matrix arising in direct optimal control
• A dual gradient-projection method for large-scale strictly convex quadratic problems

This page was built for software: QPSchur