加入
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.
+3 −1 scienceslack.json 查看文件
| @@ -25,5 +25,7 @@ | ||
| 25 | 25 | "status": "open", |
| 26 | 26 | "as_of": "2026-10-20", |
| 27 | 27 | "catalog": "0521c19bbd38" |
| 28 | - } | |
| 28 | + }, | |
| 29 | + "review": true, | |
| 30 | + "approval": "first-time" | |
| 29 | 31 | } |