Stable analysis of compressive principal component pursuit
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 6142618 (Why is no real title available?)
- A variable-penalty alternating directions method for convex optimization
- Compressive principal component pursuit
- Exact matrix completion via convex optimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Image recovery via total variation minimization and related problems
- Robust principal component analysis?
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
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)