osqp/osqp
osqp/osqp has 2,230 GitHub stars and 424 forks. GitHot measured +1 stars in 24 hours, +2 in 7 days, and +7 in 15 days. Last checked 2026-11-22 10:54 UTC. Last push 2026-01-12.
实测星标增长
- 24小时
- +1
- 7天
- +2
- 15天
- +7
- 1个月
- 正在收集历史
各周期内的星标净变化,周期相互重叠,并非每日新增。缺失的测量保持空白。星标代表关注度,不代表软件质量。
关于
算子分裂二次规划求解器
机器学习README.md
原文The Operator Splitting QP Solver
Visit our GitHub Discussions page 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.
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.
探索相关项目
加载中…