A Non-Convex Relaxation for Fixed-Rank Approximation

Carl Olsson, Marcus Carlsson, Erik Bylow

This paper considers the problem of finding a low rank matrix from observations of linear combinations of its elements. It is well known that if the problem fulfills a restricted i…