Optimal Low-Rank Matrix Completion: Semidefinite Relaxations and Eigenvector Disjunctions
Preprint on Optimization Online, 2023
A custom branch-and-bound scheme that solves low-rank matrix completion to certifiable optimality, through an eigenvector disjunctive scheme and strong semidefinite relaxations at each node.
Download here