Stable analysis of compressive principal component pursuit

DOI10.3390/A10010029zbMath1461.62092OpenAlexW2591483513MaRDI QIDQ1662624

Qun Wan, Qingshan You

Publication date: 20 August 2018

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a10010029

zbMATH Keywords

matrix completioncompressive principal component pursuitlow-complexity structurestability analytic

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Matrix completion problems (15A83)

Cites Work

• Unnamed Item
• A variable-penalty alternating directions method for convex optimization
• Image recovery via total variation minimization and related problems
• Exact matrix completion via convex optimization
• Robust principal component analysis?
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Compressive principal component pursuit
• The Power of Convex Relaxation: Near-Optimal Matrix Completion

This page was built for publication: Stable analysis of compressive principal component pursuit