Strongly convex programming for exact matrix completion and robust principal component analysis

DOI10.3934/ipi.2012.6.357zbMath1252.15042arXiv1112.3946OpenAlexW2964352004MaRDI QIDQ435847

Jian-Feng Cai, Hui Zhang, Li-Zhi Cheng, Zhu, Jubo

Publication date: 12 July 2012

Published in: Inverse Problems and Imaging (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.3946

zbMATH Keywords

robust principal component analysisdual certificatelow-rank matrixexact matrix completionstrongly convex programming

Mathematics Subject Classification ID

Random matrices (probabilistic aspects) (60B20) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Random matrices (algebraic aspects) (15B52) Matrix completion problems (15A83)

Related Items (7)

Projected shrinkage algorithm for box-constrained \(\ell _1\)-minimization ⋮ Restricted isometry property of principal component pursuit with reduced linear measurements ⋮ Accelerated Uzawa methods for convex optimization ⋮ Linear convergence of the randomized sparse Kaczmarz method ⋮ Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset ⋮ Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions ⋮ A relaxed parameter condition for the primal-dual hybrid gradient method for saddle-point problem

This page was built for publication: Strongly convex programming for exact matrix completion and robust principal component analysis