A parallelized, arbitrary precision semidefinite program solver based on the primal-dual interior-point method.
-
Updated
Feb 3, 2024 - Julia
A parallelized, arbitrary precision semidefinite program solver based on the primal-dual interior-point method.
A custom branch-and-bound algorithm for solving low-rank matrix completion to certifiable optimality
Add a description, image, and links to the semidefinite-optimization topic page so that developers can more easily learn about it.
To associate your repository with the semidefinite-optimization topic, visit your repo's landing page and select "manage topics."