加入
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.
还没有纪录
基线保持在 Speed-up over the reference implementation (×) 1。
Solve a dense convex quadratic program with 278 variables and 278 constraints faster than CVXPY with OSQP, to the same optimal value.
基线保持在 Speed-up over the reference implementation (×) 1。