A novel robust principal component analysis algorithm of nonconvex rank approximation

DOI10.1155/2020/9356935zbMATH Open1459.94027OpenAlexW3089517991MaRDI QIDQ2004251FDOQ2004251

Authors: 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

Recommendations

• Robust PCA using nonconvex rank approximation and sparse regularizer
• Fast algorithms for robust principal component analysis with an upper bound on the rank
• scientific article
• An alternating minimization method for robust principal component analysis
• Nonconvex Regularized Robust PCA Using the Proximal Block Coordinate Descent Algorithm
• The nonconvex tensor robust principal component analysis approximation model via the weighted \(\ell_p\)-norm regularization
• On the complexity of robust PCA and \(\ell_1\)-norm low-rank matrix approximation
• Robust principal component analysis: a factorization-based approach with linear complexity
• Robust sparse \(L_p\)-norm principal component analysis

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• The nonconvex tensor robust principal component analysis approximation model via the weighted \(\ell_p\)-norm regularization
• Title not available (Why is that?)
• Robust principal component pursuit via inexact alternating minimization on matrix manifolds

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2004251)