Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data
From MaRDI portal
Publication:2440136
DOI10.1007/s10483-014-1788-6zbMath1283.49025OpenAlexW2314777493MaRDI QIDQ2440136
Wei Zhu, Li-Zhi Cheng, Shi Shu
Publication date: 27 March 2014
Published in: Applied Mathematics and Mechanics. (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10483-014-1788-6
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing ⋮ Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset ⋮ New regularization method and iteratively reweighted algorithm for sparse vector recovery
Uses Software
Cites Work
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Robust principal component analysis?
- A Singular Value Thresholding Algorithm for Matrix Completion
- Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- Rank-Sparsity Incoherence for Matrix Decomposition
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Signal Recovery by Proximal Forward-Backward Splitting
- Proximité et dualité dans un espace hilbertien
- Unnamed Item
- Unnamed Item
This page was built for publication: Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data
