Matrix completion and vector completion via robust subspace learning

In experiments, the proposed method and other state-of-the-art algorithms will be used to cope with two problems: matrix completion and vector completion. Numerical results on real datasets and artificial datasets demonstrate that our method can provide a significant performance advantage over alternative methods.