Optimal Low-Rank Matrix Completion: Semidefinite Relaxations and Eigenvector Disjunctions

2 code implementations • 20 May 2023 • Dimitris Bertsimas, Ryan Cory-Wright, Sean Lo, Jean Pauphilet

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

Low-Rank Matrix Completion Product Recommendation