Strongly Convex Programming for Exact Matrix Completion and Robust Principal Component Analysis

Details Strongly Convex Programming for Exact Matrix Completion and Robust Principal Component Analysis Strongly Convex Programming for Exact Matrix Completion and Robust Principal Component Analysis

2011-12-16

arxiv.org/abs/1112.3946v2

Computer Science

Information Theory

17 pages

Scientific paper

The common task in matrix completion (MC) and robust principle component analysis (RPCA) is to recover a low-rank matrix from a given data matrix. These problems gained great attention from various areas in applied sciences recently, especially after the publication of the pioneering works of Cand`es et al.. One fundamental result in MC and RPCA is that nuclear norm based convex optimizations lead to the exact low-rank matrix recovery under suitable conditions. In this paper, we extend this result by showing that strongly convex optimizations can guarantee the exact low-rank matrix recovery as well. The result in this paper not only provides sufficient conditions under which the strongly convex models lead to the exact low-rank matrix recovery, but also guides us on how to choose suitable parameters in practical algorithms.

Affiliated with

Also associated with

No associations

Rating

Strongly Convex Programming for Exact Matrix Completion and Robust Principal Component Analysis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Strongly Convex Programming for Exact Matrix Completion and Robust Principal Component Analysis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Strongly Convex Programming for Exact Matrix Completion and Robust Principal Component Analysis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-170491