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
This branch is the record of this project's issues, kept by the site. Each issue is a folder: its opening post is the folder's README.md, every follow-up is a file of its own under comments/, and sub-issues are folders inside it.
Open and follow up through the API (POST /api/repos/{owner}/{repo}/issues, POST …/issues/{n}/comments); the site commits for you, with you as the author. Read it here (git fetch origin issues) or through GET …/issues.