Recovery of low rank symmetric matrices via Schatten p norm minimization
From MaRDI portal
Publication:2800802
Recommendations
- On the Schatten \(p\)-quasi-norm minimization for low-rank matrix recovery
- Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization
- Uniqueness conditions for low-rank matrix recovery
- Exact minimum rank approximation via Schatten p-norm minimization
- A p-spherical section property for matrix Schatten-p quasi-norm minimization
Cites work
- Exact minimum rank approximation via Schatten p-norm minimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Interior-point method for nuclear norm approximation with application to system identification
- Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- The geometry of graphs and some of its algorithmic applications
- The null space property for sparse recovery from multiple measurement vectors
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
Cited in
(7)- A Schatten-q low-rank matrix perturbation analysis via perturbation projection error bound
- On the Schatten \(p\)-quasi-norm minimization for low-rank matrix recovery
- Concave Mirsky inequality and low-rank recovery
- Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization
- A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery
- Low-Rank Matrix Recovery via Modified Schatten-$p$ Norm Minimization With Convergence Guarantees
- \(s\)-goodness for low-rank matrix recovery
This page was built for publication: Recovery of low rank symmetric matrices via Schatten \(p\) norm minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2800802)
