Restricted isometry property of principal component pursuit with reduced linear measurements
From MaRDI portal
Publication:2375728
DOI10.1155/2013/959403zbMath1268.90050OpenAlexW2009348723WikidataQ59007157 ScholiaQ59007157MaRDI QIDQ2375728
Qun Wan, Haiwen Xu, Qingshan You
Publication date: 14 June 2013
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/959403
convex optimizationcompressive principal component pursuitprincipal component pursuit with reduced linear measurements
Cites Work
- Strongly convex programming for exact matrix completion and robust principal component analysis
- Image recovery via total variation minimization and related problems
- Adaptive estimation of a quadratic functional by model selection.
- A short note on strongly convex programming for exact matrix completion and robust principal component analysis
- Matrix concentration inequalities via the method of exchangeable pairs
- 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
This page was built for publication: Restricted isometry property of principal component pursuit with reduced linear measurements