\`x^2+y_1+z_12^34\`
Advanced Search
Article Contents
Article Contents

A short note on strongly convex programming for exact matrix completion and robust principal component analysis

Abstract Related Papers Cited by
  • In paper "Strongly Convex Programming for Exact Matrix Completion and Robust Principal Component Analysis", an explicit lower bound of $\tau$ is strongly based on Theorem 3.4. However, a coefficient is missing in the proof of Theorem 3.4, which leads to improper result. In this paper, we correct this error and provide the right bound of $\tau$.
    Mathematics Subject Classification: Primary: 15B52, 90C25; Secondary: 60B20.

    Citation:

    \begin{equation} \\ \end{equation}
  • [1]

    Hui Zhang, Jian-Feng Cai, Lizhi Cheng and Jubo Zhu, Strongly convex programming for exact matrix completion and robust principal component analysis, Inverse Problems and Imaging, 6 (2012), 357-372.doi: 10.3934/ipi.2012.6.357.

  • 加载中
SHARE

Article Metrics

HTML views() PDF downloads(51) Cited by(0)

Access History

Other Articles By Authors

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return