Stable analysis of compressive principal component pursuit
DOI10.3390/A10010029zbMATH Open1461.62092OpenAlexW2591483513MaRDI QIDQ1662624FDOQ1662624
Authors: Qingshan You, Qun Wan 
Publication date: 20 August 2018
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a10010029
Recommendations
- Compressive principal component pursuit
- Restricted isometry property of principal component pursuit with reduced linear measurements
- Efficient algorithms for robust and stable principal component pursuit problems
- Scalable robust matrix recovery: Frank-Wolfe meets proximal methods
- A customized proximal point algorithm for stable principal component pursuit with nonnegative constraint
Factor analysis and principal components; correspondence analysis (62H25) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Matrix completion problems (15A83) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- Robust principal component analysis?
- Exact matrix completion via convex optimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Image recovery via total variation minimization and related problems
- Compressive principal component pursuit
- A variable-penalty alternating directions method for convex optimization
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: Stable analysis of compressive principal component pursuit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662624)
