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.
No record yet
The baseline stands at 1 Speed-up over the reference implementation (×).