Join our forum for any questions related to the solver!
The documentation is available at osqp.readthedocs.io
The OSQP (Operator Splitting Quadratic Program) solver is a numerical optimization package for solving problems in the form
minimize 0.5 x' P x + q' x
subject to l <= A x <= u
where x in R^n is the optimization variable. The objective function is defined by a positive semidefinite matrix P in S^n_+ and vector q in R^n. The linear constraints are defined by matrix A in R^{m x n} and vectors l in R^m U {-inf}^m, u in R^m U {+inf}^m.
The latest version is 0.3.0.
| System | Status | Coverage |
|---|---|---|
| Linux / OSX |  |
 |
| Windows |
If you are using OSQP for your work, we encourage you to
- Cite the related papers,
- Put a star on this repository.
We are looking forward to hearing your success stories with OSQP! Please share them with us.
The following people have been involved in the development of OSQP:
- Bartolomeo Stellato (University of Oxford): main development
- Goran Banjac (University of Oxford): main development
- Nicholas Moehle (Stanford University): methods, maths, and code generation
- Paul Goulart (University of Oxford): methods, maths, and Matlab interface
- Alberto Bemporad (IMT Lucca): methods and maths
- Nick Gould (Rutherford Appleton Laboratory): Fortran and CUTEst interfaces
- Stephen Boyd (Stanford University): methods and maths
Please report any issues via the Github issue tracker. All types of issues are welcome including bug reports, documentation typos, feature requests and so on.
Numerical benchmarks against other solvers are available here.