Mj23366
08d5a1f4cc
first commit
|
1 anno fa | |
|---|---|---|
| .. | ||
| build | 1 anno fa | |
| ci | 1 anno fa | |
| configure | 1 anno fa | |
| examples | 1 anno fa | |
| include | 1 anno fa | |
| lin_sys | 1 anno fa | |
| src | 1 anno fa | |
| tests | 1 anno fa | |
| .bumpversion.cfg | 1 anno fa | |
| .editorconfig | 1 anno fa | |
| .gitattributes | 1 anno fa | |
| .gitmodules | 1 anno fa | |
| .travis.yml | 1 anno fa | |
| .valgrind-suppress.supp | 1 anno fa | |
| CHANGELOG.md | 1 anno fa | |
| CMakeLists.txt | 1 anno fa | |
| LICENSE | 1 anno fa | |
| NOTICE | 1 anno fa | |
| README.md | 1 anno fa | |
| ROADMAP.md | 1 anno fa | |
| appveyor.yml | 1 anno fa | |
| make | 1 anno fa | |
README.md
The Operator Splitting QP Solver
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.0.
Citing OSQP
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.
Bug reports and support
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
Numerical benchmarks against other solvers are available here.