commit | 9049e209feadaab0336e96bf9c1d861f60cc5aa9 | [log] [tgz] |
---|---|---|
author | Austin Schuh <austin.linux@gmail.com> | Sun Feb 20 17:34:16 2022 -0800 |
committer | Austin Schuh <austin.linux@gmail.com> | Sun Feb 20 17:34:16 2022 -0800 |
tree | 2a21e509618e4bab5c21b10d900c5ee655583b43 |
Squashed 'third_party/osqp/' content from commit 33454b3e23 Change-Id: I056df0582ca06664e86554c341a94c47ab932001 git-subtree-dir: third_party/osqp git-subtree-split: 33454b3e236f1f44193bfbbb6b8c8e71f8f04e9a Signed-off-by: Austin Schuh <austin.linux@gmail.com>
Join our forum on Discourse for any questions related to the solver!
The documentation is available at osqp.org
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
and u
so that l_i in R U {-inf}
and u_i in R U {+inf}
for all i in 1,...,m
.
The latest version is 0.6.2
.
If you are using OSQP for your work, we encourage you to
We are looking forward to hearing your success stories with OSQP! Please share them with us.
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.