Iterative hard thresholding for low-rank recovery from rank-one projections
From MaRDI portal
Publication:2419026
DOI10.1016/j.laa.2019.03.007zbMath1433.65084arXiv1810.11749OpenAlexW2963839538MaRDI QIDQ2419026
Simon Foucart, Srinivas Subramanian
Publication date: 29 May 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.11749
compressive sensingsingular value thresholdinglow-rank recoveryrank-one projectionsrank-restricted isometry properties
Eigenvalues, singular values, and eigenvectors (15A18) Iterative numerical methods for linear systems (65F10) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Related Items
On the robustness of noise-blind low-rank recovery from rank-one measurements, Low rank matrix recovery with impulsive noise, Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms, Adaptive iterative hard thresholding for low-rank matrix recovery and rank-one measurements, Jointly low-rank and bisparse recovery: Questions and partial answers, Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization, Low rank matrix recovery with adversarial sparse noise*
Uses Software
Cites Work
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- Recovering low-rank matrices from binary measurements
- ROP: matrix recovery via rank-one projections
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
- Normalized Iterative Hard Thresholding for Matrix Completion
- Approximation Algorithms for Model-Based Compressive Sensing
- Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
- Sparse recovery with pre-Gaussian random matrices
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
