Home (original) (raw)

PIQP is a Proximal Interior Point Quadratic Programming solver, which can solve dense and sparse quadratic programs of the form

\[\begin{aligned} \min_{x} \quad & \frac{1}{2} x^\top P x + c^\top x \\ \text {s.t.}\quad & Ax=b, \\ & h_l \leq Gx \leq h_u, \\ & x_l \leq x \leq x_u, \end{aligned}\]

with primal decision variables \(x \in \mathbb{R}^n\), matrices \(P\in \mathbb{S}_+^n\), \(A \in \mathbb{R}^{p \times n}\), \(G \in \mathbb{R}^{m \times n}\), and vectors \(c \in \mathbb{R}^n\), \(b \in \mathbb{R}^p\), \(h_l \in \mathbb{R}^m\), \(h_u \in \mathbb{R}^m\), \(x_l \in \mathbb{R}^n\), and \(x_u \in \mathbb{R}^n\). Combining an infeasible interior point method with the proximal method of multipliers, the algorithm can handle ill-conditioned convex QP problems without the need for linear independence of the constraints.

For more detailed technical results see our papers:

PIQP: A Proximal Interior-Point Quadratic Programming Solver
R. Schwan, Y. Jiang, D. Kuhn, C.N. Jones
IEEE Conference on Decision and Control (CDC), 2023

Exploiting Multistage Optimization Structure in Proximal Solvers
R. Schwan, D. Kuhn, C.N. Jones
ArXiv, 2025

Features

Interfaces

PIQP support a wide range of interfaces including

Credits

PIQP is developed by the following people:

All contributors are affiliated with the Laboratoire d’Automatique and/or the Risk Analytics and Optimization Chair at EPFL, Switzerland.

This work was supported by the Swiss National Science Foundation under the NCCR Automation (grant agreement 51NF40_180545).

PIQP is an adapted implementation of work by Spyridon Pougkakiotis and Jacek Gondzio, and is built on the following open-source libraries:

License

PIQP is licensed under the BSD 2-Clause License.