Stable rank one matrix completion is solved by two rounds of semidefinite programming relaxation

Augustin Cosse, Laurent Demanet

This paper studies the problem of deterministic rank-one matrix completion. It is known that the simplest semidefinite programming relaxation, involving minimization of the nuclear…