Sākums Izpētīt Palīdzība
Reģistrēties Pierakstīties
XuMengJie
/
agv_ros_ws
1
0
Atdalīts 0
Faili Problēmas 0 Izmaiņu pieprasījumi 0 Vikivietne
Atzars: master
Atzari Tagi
agv_ros_ws
/
osqp
Mj23366 08d5a1f4cc first commit 2 nedēļas atpakaļ
..
build 08d5a1f4cc first commit 2 nedēļas atpakaļ
ci 08d5a1f4cc first commit 2 nedēļas atpakaļ
configure 08d5a1f4cc first commit 2 nedēļas atpakaļ
examples 08d5a1f4cc first commit 2 nedēļas atpakaļ
include 08d5a1f4cc first commit 2 nedēļas atpakaļ
lin_sys 08d5a1f4cc first commit 2 nedēļas atpakaļ
src 08d5a1f4cc first commit 2 nedēļas atpakaļ
tests 08d5a1f4cc first commit 2 nedēļas atpakaļ
.bumpversion.cfg 08d5a1f4cc first commit 2 nedēļas atpakaļ
.editorconfig 08d5a1f4cc first commit 2 nedēļas atpakaļ
.gitattributes 08d5a1f4cc first commit 2 nedēļas atpakaļ
.gitmodules 08d5a1f4cc first commit 2 nedēļas atpakaļ
.travis.yml 08d5a1f4cc first commit 2 nedēļas atpakaļ
.valgrind-suppress.supp 08d5a1f4cc first commit 2 nedēļas atpakaļ
CHANGELOG.md 08d5a1f4cc first commit 2 nedēļas atpakaļ
CMakeLists.txt 08d5a1f4cc first commit 2 nedēļas atpakaļ
LICENSE 08d5a1f4cc first commit 2 nedēļas atpakaļ
NOTICE 08d5a1f4cc first commit 2 nedēļas atpakaļ
README.md 08d5a1f4cc first commit 2 nedēļas atpakaļ
ROADMAP.md 08d5a1f4cc first commit 2 nedēļas atpakaļ
appveyor.yml 08d5a1f4cc first commit 2 nedēļas atpakaļ
make 08d5a1f4cc first commit 2 nedēļas atpakaļ

README.md

The Operator Splitting QP Solver

Build status of the master branch on Linux/OSX Build status of the master branch on Windows Code coverage License

PyPI - downloads Conda - downloads

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

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.