Recovery of low-rank matrices based on the rank null space properties
From MaRDI portal
Publication:5348779
DOI10.1142/S0219691317500321zbMath1408.15018MaRDI QIDQ5348779
Publication date: 21 August 2017
Published in: International Journal of Wavelets, Multiresolution and Information Processing (Search for Journal in Brave)
Probability distributions: general theory (60E05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Random matrices (algebraic aspects) (15B52) Sampling theory in information and communication theory (94A20)
Related Items
The null space property of the weighted ℓr − ℓ1 minimization, Low-rank matrix recovery via regularized nuclear norm minimization, Perturbation analysis of low-rank matrix stable recovery
Cites Work
- Unnamed Item
- Matrix completion via max-norm constrained optimization
- A mathematical introduction to compressive sensing
- Exact minimum rank approximation via Schatten \(p\)-norm minimization
- On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing
- Null space conditions and thresholds for rank minimization
- A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery
- Stability of low-rank matrix recovery and its connections to Banach space geometry
- Convex multi-task feature learning
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- A simple proof of the restricted isometry property for random matrices
- Multi-view low-rank dictionary learning for image classification
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Convergence of projected Landweber iteration for matrix rank minimization
- Exact matrix completion via convex optimization
- Stability of lq-analysis based dual frame with Weibull matrices for 0 < q ≤ 1
- Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
- Compressed sensing and best 𝑘-term approximation
- Restricted isometry properties and nonconvex compressive sensing
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- 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
- Matrix Completion From a Few Entries
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Compressed sensing
