Low-rank matrix recovery via regularized nuclear norm minimization
From MaRDI portal
Publication:2036488
DOI10.1016/j.acha.2021.03.001zbMath1469.65090arXiv1903.01053MaRDI QIDQ2036488
Feng Zhang, Wendong Wang, Jian-Jun Wang
Publication date: 29 June 2021
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.01053
low-rank matrix recovery; restricted isometry property; regularized nuclear norm minimization; robust null space property
90C25: Convex programming
94A12: Signal theory (characterization, reconstruction, filtering, etc.)
15A03: Vector spaces, linear dependence, rank, lineability
65F99: Numerical linear algebra
Related Items
Perturbation analysis of low-rank matrix stable recovery, A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems, Perturbation analysis of \(L_{1-2}\) method for robust sparse recovery
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A mathematical introduction to compressive sensing
- The bounds of restricted isometry constants for low rank matrices recovery
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery
- Convex multi-task feature learning
- Signal recovery under cumulative coherence
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization
- Stable recovery of analysis based approaches
- Atomic Decomposition by Basis Pursuit
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- Augmented $\ell_1$ and Nuclear-Norm Models with a Globally Linearly Convergent Algorithm
- Robust principal component analysis?
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- A Proof of Conjecture on Restricted Isometry Property Constants $\delta _{tk}\ \left(0<t<\frac {4}{3}\right)$
- Compressed Sensing and Affine Rank Minimization Under Restricted Isometry
- Flavors of Compressive Sensing
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Recovery of low-rank matrices based on the rank null space properties