A custom branch-and-bound algorithm for solving low-rank matrix completion to certifiable optimality
-
Updated
Nov 26, 2024 - Julia
A custom branch-and-bound algorithm for solving low-rank matrix completion to certifiable optimality
Add a description, image, and links to the disjunctive-programming topic page so that developers can more easily learn about it.
To associate your repository with the disjunctive-programming topic, visit your repo's landing page and select "manage topics."