TL;DR
OSQP is a robust, efficient, and open-source quadratic programming solver based on operator splitting, suitable for real-time embedded applications and capable of detecting infeasibility.
Contribution
It introduces a novel operator splitting technique for quadratic programs that is robust, efficient, and capable of infeasibility detection, outperforming traditional methods.
Findings
Typically ten times faster than interior-point methods
Supports factorization caching and warm starting
Successfully used in diverse real-world applications
Abstract
We present a general-purpose solver for convex quadratic programs based on the alternating direction method of multipliers, employing a novel operator splitting technique that requires the solution of a quasi-definite linear system with the same coefficient matrix at almost every iteration. Our algorithm is very robust, placing no requirements on the problem data such as positive definiteness of the objective function or linear independence of the constraint functions. It can be configured to be division-free once an initial matrix factorization is carried out, making it suitable for real-time applications in embedded systems. In addition, our technique is the first operator splitting method for quadratic programs able to reliably detect primal and dual infeasible problems from the algorithm iterates. The method also supports factorization caching and warm starting, making it…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
