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.
Pull requests
Pull requests bring work from one route into another; merging one adopts it.
No open pull requests
Pull requests bring work from one branch into another.