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

Qingshan You; Qun Wan; Yipeng Liu

doi:10.3934/ipi.2013.7.305

Article Contents

2013, Volume 7, Issue 1: 305-306. Doi: 10.3934/ipi.2013.7.305

This issue Previous Article A decomposition method for an interior inverse scattering problem Next Article

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

1.
School of Electronic Engineering, University of Electronic Science and Technology of China, Chengdu, Sichuan, 611731
2.
Department of Electrical Engineering, ESAT-SCD / IBBT - KU, Leuven Future Health Department, KU Leuven, Kasteelpark Arenberg 10, box 2446, 3001 Heverlee

Received: July 2012

Revised: November 2012

Published: February 2013

Abstract / Introduction Related Papers Cited by

Abstract

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$.

Keywords:

Mathematics Subject Classification: Primary: 15B52, 90C25; Secondary: 60B20.

Citation: