Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion

Dimitris Bertsimas, Ryan Cory-Wright, Sean Lo +1

Low-rank matrix completion consists of computing a matrix of minimal complexity that recovers a given set of observations as accurately as possible. Unfortunately, existing methods…