Recovery of low-rank matrices based on the rank null space properties
From MaRDI portal
Publication:5348779
Recommendations
- Stable low-rank matrix recovery via null space properties
- Low rank matrix recovery from rank one measurements
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Necessary and Sufficient Null Space Condition for Nuclear Norm Minimization in Low-Rank Matrix Recovery
- Reconstruction of a high-dimensional low-rank matrix
- Low-rank matrix recovery via regularized nuclear norm minimization
- Recovering low-rank matrices from binary measurements
- Proof methods for robust low-rank matrix recovery
- Nonconvex Robust Low-Rank Matrix Recovery
Cites work
- A mathematical introduction to compressive sensing
- A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery
- A simple proof of the restricted isometry property for random matrices
- Compressed sensing
- Compressed sensing and best \(k\)-term approximation
- Convergence of projected Landweber iteration for matrix rank minimization
- Convex multi-task feature learning
- Decoding by Linear Programming
- Exact matrix completion via convex optimization
- Exact minimum rank approximation via Schatten p-norm minimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Matrix Completion From a Few Entries
- Matrix completion via max-norm constrained optimization
- Multi-view low-rank dictionary learning for image classification
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Null space conditions and thresholds for rank minimization
- On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing
- Restricted isometry properties and nonconvex compressive sensing
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Spectral regularization algorithms for learning large incomplete matrices
- Stability of \(l_q\)-analysis based dual frame with Weibull matrices for \(0<q\leq 1\)
- Stability of low-rank matrix recovery and its connections to Banach space geometry
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Uniqueness of low-rank matrix completion by rigidity theory
Cited in
(13)- Recovering low-rank matrices from binary measurements
- Sensitivity of low-rank matrix recovery
- The null space property of the weighted ℓr − ℓ1 minimization
- Low-rank matrix recovery via regularized nuclear norm minimization
- Real versus complex null space properties for sparse vector recovery
- Perturbation analysis of low-rank matrix stable recovery
- Sparse recovery on Euclidean Jordan algebras
- Stability of low-rank matrix recovery and its connections to Banach space geometry
- Low rank matrix recovery from rank one measurements
- Null space conditions and thresholds for rank minimization
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Minimization of the difference of nuclear and Frobenius norms for noisy low rank matrix recovery
- Guarantees of fast band restricted thresholding algorithm for low-rank matrix recovery problem
This page was built for publication: Recovery of low-rank matrices based on the rank null space properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5348779)
