Quasi-Hankel low-rank matrix completion: a convex relaxation

Konstantin Usevich, Pierre Comon

The completion of matrices with missing values under the rank constraint is a non-convex optimization problem. A popular convex relaxation is based on minimization of the nuclear n…