Quadratic Programming
Also known as QP
Overview
Quadratic programming (QP) studies how to minimize or maximize a quadratic objective subject to constraints, commonly linear ones. It appears in robotics and control, portfolio decisions, model merging, and game-solving, where it can balance goals while enforcing safety or resource limits. Common approaches include active-set and interior-point methods, primal-dual solvers, and ADMM, with GPU acceleration, warm starts, and constraint relaxation used for large or real-time problems. A central challenge is making solvers fast and numerically reliable when problems are large, degenerate, or infeasible, without losing useful guarantees.
Latest papers
24 papers3 papers in the last four weeks, level with the four weeks before. 0.0% of all new papers.