Uniqueness conditions for low-rank matrix recovery
Authors:
- Y.C. EldarYEY.C. Eldar
- D. NeedellDND. Needell
- Y. PlanYPY. Plan
- 1 September 2012
- journal article
- Published by Elsevier in Applied and Computational Harmonic Analysis
- Vol. 33 (2) , 309-314
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Rank Minimization Over Finite Fields: Fundamental Limits and Coding-Theoretic InterpretationsIEEE Transactions on Information Theory, 2011
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random MeasurementsIEEE Transactions on Information Theory, 2011
- Recovering Low-Rank Matrices From Few Coefficients in Any BasisIEEE Transactions on Information Theory, 2011
- ADMiRA: Atomic Decomposition for Minimum Rank ApproximationIEEE Transactions on Information Theory, 2010
- Matrix Completion With NoiseProceedings of the IEEE, 2010
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm MinimizationSIAM Review, 2010
- A Singular Value Thresholding Algorithm for Matrix CompletionSIAM Journal on Optimization, 2010
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency informationIEEE Transactions on Information Theory, 2006