2018
An Improved Initialization for Low-Rank Matrix Completion Based on Rank-L Updates
ICASSP 2018accepted
Given a data matrix with partially observed entries, the low-rank matrix completion problem is one of finding a matrix with the lowest rank that perfectly fits the given observations. While there exist convex relaxations for the low-rank completion problem, the underlying problem is inherently nonco…