A short note on strongly convex programming for exact matrix completion and robust principal component analysis (Q1951316)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A short note on strongly convex programming for exact matrix completion and robust principal component analysis |
scientific article |
Statements
A short note on strongly convex programming for exact matrix completion and robust principal component analysis (English)
0 references
5 June 2013
0 references
From the abstract: In the paper ``Strongly convex programming for exact matrix completion and robust principal component analysis'' [\textit{H. Zhang, J.-F. Cai, L. Cheng} and \textit{J. Zhu}, Inverse Probl. Imaging 6, No. 2, 357--372 (2012; Zbl 1252.15042)], an explicit lower bound on \(\tau\) is strongly based on Theorem 3.4. However, a coefficient is missing in the proof of this theorem leading to an improper result. In this paper, this error is corrected, and the right bound on \(\tau\) is provided.
0 references
matrix completion
0 references
low-complexity structure
0 references
strongly convex programming
0 references
principal component pursuit
0 references