加入
Faster convex quadratic programming
Solve a dense convex quadratic program with 278 variables and 278 constraints faster than CVXPY with OSQP, to the same optimal value.
| # | 路线 | Speed-up over the reference implementation (×) ↑ | 对比基线 |
|---|---|---|---|
| — | 基线 · Reference implementation | 1 | 条形从这里开始 |