A novel robust principal component analysis algorithm of nonconvex rank approximation

DOI10.1155/2020/9356935zbMath1459.94027OpenAlexW3089517991MaRDI QIDQ2004251

Yanyan Li

Publication date: 14 October 2020

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/9356935

Mathematics Subject Classification ID

Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nearly unbiased variable selection under minimax concave penalty
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Principal component analysis.
• A Singular Value Thresholding Algorithm for Matrix Completion
• A Fast Algorithm for Edge-Preserving Variational Multichannel Image Restoration
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Background Subtraction Based on Low-Rank and Structured Sparse Decomposition
• A General-Thresholding Solution for l_p(0 <; p <; 1) Regularized CT Reconstruction
• Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
• De-noising by soft-thresholding
• Confidence Region of Singular Subspaces for Low-Rank Matrix Regression
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• LOW-RANK AND SPARSE MATRIX RECOVERY FROM NOISY OBSERVATIONS VIA 3-BLOCK ADMM ALGORITHM

This page was built for publication: A novel robust principal component analysis algorithm of nonconvex rank approximation