Low-rank matrix recovery via rank one tight frame measurements
From MaRDI portal
Publication:666654
DOI10.1007/s00041-017-9579-xzbMath1409.94843arXiv1612.03108OpenAlexW2564982350MaRDI QIDQ666654
Holger Rauhut, Ulrich Terstiege
Publication date: 6 March 2019
Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.03108
convex optimizationphase retrievalquantum state tomographynuclear norm minimizationlow rank matrix recoveryrandom measurementspositive semidefinite least squares problem
Random matrices (probabilistic aspects) (60B20) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)
Uses Software
Cites Work
- Low rank matrix recovery from rank one measurements
- A mathematical introduction to compressive sensing
- A comparison principle for functions of a uniformly random subspace
- Learning without Concentration
- Convex Recovery of a Structured Signal from Independent Random Linear Measurements
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
- Bounding the Smallest Singular Value of a Random Matrix Without Concentration
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Stable low-rank matrix recovery via null space properties