Proof Methods for Robust Low-Rank Matrix Recovery
- 22 October 2022
- book chapter
- Published by Springer Nature
- p. 37-75
Abstract
No abstract availableKeywords
All Related Versions
This publication has 75 references indexed in Scilit:
- Phase retrieval: Stability and recovery guaranteesApplied and Computational Harmonic Analysis, 2014
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex ProgrammingCommunications on Pure and Applied Mathematics, 2012
- User-Friendly Tail Bounds for Sums of Random MatricesFoundations of Computational Mathematics, 2011
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009
- Decoding by Linear ProgrammingIEEE Transactions on Information Theory, 2005
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorizationMathematical Programming, 2003
- Phase problem in crystallographyJournal of the Optical Society of America A, 1993
- Phase retrieval in crystallography and opticsJournal of the Optical Society of America A, 1990
- On Milman's inequality and random subspaces which escape through a mesh in ℝ n1988
- Phase retrieval algorithms: a comparisonApplied Optics, 1982