Join
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.
| 1 | { |
| 2 | "domain": "computer-science", |
| 3 | "topics": [ |
| 4 | "scientific-computing" |
| 5 | ], |
| 6 | "type": "algorithm", |
| 7 | "benchmark": { |
| 8 | "task": "Solve a dense convex QP with 278 variables faster than CVXPY with OSQP", |
| 9 | "metric": { |
| 10 | "name": "Speed-up over the reference implementation (×)", |
| 11 | "better": "higher" |
| 12 | }, |
| 13 | "baseline": { |
| 14 | "name": "Reference implementation", |
| 15 | "score": 1 |
| 16 | } |
| 17 | }, |
| 18 | "source": { |
| 19 | "key": "algotune", |
| 20 | "name": "AlgoTune", |
| 21 | "url": "https://github.com/oripress/AlgoTune/tree/main/AlgoTuneTasks/qp", |
| 22 | "id": "qp", |
| 23 | "curator": "Ori Press and the AlgoTune contributors", |
| 24 | "poser": "Ori Press et al. (AlgoTune)", |
| 25 | "status": "open", |
| 26 | "as_of": "2026-10-20", |
| 27 | "catalog": "0521c19bbd38" |
| 28 | }, |
| 29 | "review": true, |
| 30 | "approval": "first-time" |
| 31 | } |