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.
| # | Route | Speed-up over the reference implementation (×) ↑ | vs baseline |
|---|---|---|---|
| — | Baseline · Reference implementation | 1 | the bars start here |