Stable low-rank matrix recovery via null space properties
From MaRDI portal
Publication:4606522
DOI10.1093/imaiai/iaw014zbMath1388.94018arXiv1507.07184OpenAlexW2963863416MaRDI QIDQ4606522
Holger Rauhut, Ulrich Terstiege, Richard Kueng, Maryia Kabanava
Publication date: 8 March 2018
Published in: Information and Inference (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.07184
convex optimizationphase retrievallow-rank matrix recoveryquantum state tomographynuclear norm minimizationcomplex projective designsrandom measurementspositive semidefinite least squares problem
Related Items
WARPd: A Linearly Convergent First-Order Primal-Dual Algorithm for Inverse Problems with Approximate Sharpness Conditions, Estimation of low rank density matrices: bounds in Schatten norms and other distances, Stable and robust $\ell_p$-constrained compressive sensing recovery via robust width property, On the robustness of noise-blind low-rank recovery from rank-one measurements, Mixing properties of stochastic quantum Hamiltonians, Compressive statistical learning with random feature moments, On connections between amplitude flow and error reduction for phase retrieval and ptychography, Algebraic compressed sensing, Gradient descent for deep matrix factorization: dynamics and implicit bias towards low rank, Complex phase retrieval from subgaussian measurements, Low-rank matrix recovery via rank one tight frame measurements, Unnamed Item, Phase retrieval with PhaseLift algorithm, Tensor-free proximal methods for lifted bilinear/quadratic inverse problems with applications to phase retrieval, Jointly low-rank and bisparse recovery: Questions and partial answers, Guarantees of Riemannian Optimization for Low Rank Matrix Recovery, Truncated sparse approximation property and truncated \(q\)-norm minimization, Perturbation analysis of low-rank matrix stable recovery, Proof methods for robust low-rank matrix recovery, Fast state tomography with optimal error bounds, Statistical analysis of compressive low rank tomography with random measurements, An analysis of noise folding for low-rank matrix recovery
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved recovery guarantees for phase retrieval from coded diffraction patterns
- Low rank matrix recovery from rank one measurements
- A mathematical introduction to compressive sensing
- Sharp recovery bounds for convex demixing, with applications
- Stable optimizationless recovery from phaseless linear measurements
- Solving quadratic equations via phaselift when there are about as many equations as unknowns
- Null space conditions and thresholds for rank minimization
- User-friendly tail bounds for sums of random matrices
- Painless reconstruction from magnitudes of frame coefficients
- Distinguishability of quantum states under restricted families of measurements with an application to quantum data hiding
- Characterization of the law of the iterated logarithm in Banach spaces
- The convex geometry of linear inverse problems
- Quantum tomography under prior information
- A partial derandomization of phaselift using spherical designs
- Simultaneous analysis of Lasso and Dantzig selector
- Exact matrix completion via convex optimization
- 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
- Normalized Iterative Hard Thresholding for Matrix Completion
- Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming
- Phase Retrieval via Wirtinger Flow: Theory and Algorithms
- Compressive Multiplexing of Correlated Signals
- Quantum Computation and Quantum Information
- Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
- Tight informationally complete quantum measurements
- Bounding the Smallest Singular Value of a Random Matrix Without Concentration
- On sparse reconstruction from Fourier and Gaussian measurements
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
- Strong converse for identification via quantum channels
- Some estimates of norms of random matrices
- Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
- Living on the edge: phase transitions in convex programs with random data
- The role of topology in quantum tomography
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- ADMiRA: Atomic Decomposition for Minimum Rank Approximation
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Condition Numbers of Gaussian Random Matrices
- Phase Retrieval via Matrix Completion
