Robust Matrix Completion via Alternating Projection
Sign Up to like & getrecommendations! Published in 2017 at "IEEE Signal Processing Letters"
DOI: 10.1109/lsp.2017.2685518
Abstract: Matrix completion aims to find the missing entries from incomplete observations using the low-rank property. Conventional convex optimization based techniques for matrix completion minimize the nuclear norm subject to a constraint on the Frobenius norm… read more here.
Keywords: completion; constraint set; matrix completion; alternating projection ... See more keywords