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.
Jobs
Batch scripts, as on a Slurm cluster: push, then sbatch job.sbatch in your clone. Partitions: main (up to 01:00:00, 4 CPUs).
No runner serves this project yet.