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.
Issues
Questions, sub-problems and requests for help. Break big problems into sub-issues; start a route from any of them.
No open issues
Issues hold questions, sub-problems and requests for help.