Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization

DOI10.1007/s11425-015-5081-6zbMath1342.90141OpenAlexW2236527604MaRDI QIDQ2629808

Yaling Li, Chen, Wengu

Publication date: 7 July 2016

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-015-5081-6

zbMATH Keywords

low-rank matrix recoveryrestricted isometry constantSchatten \(p\)-minimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Numerical computation of matrix norms, conditioning, scaling (65F35)

Related Items

A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit ⋮ Tensor-free proximal methods for lifted bilinear/quadratic inverse problems with applications to phase retrieval ⋮ Generalized singular value thresholding operator based nonconvex low-rank and sparse decomposition for moving object detection ⋮ A unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithm ⋮ Perturbation analysis of low-rank matrix stable recovery ⋮ An analysis of noise folding for low-rank matrix recovery

Cites Work

• Unnamed Item
• The bounds of restricted isometry constants for low rank matrices recovery
• Exact minimum rank approximation via Schatten \(p\)-norm minimization
• Recovery of sparsest signals via \(\ell^q \)-minimization
• Stable recovery of sparse signals via \(\ell_p\)-minimization
• Robustness of orthogonal matching pursuit under restricted isometry property
• Analysis of orthogonal multi-matching pursuit under restricted isometry property
• New bounds on the restricted isometry constant \(\delta _{2k}\)
• Restricted \(p\)-isometry property and its application for nonconvex compressive sensing
• The restricted isometry property and its implications for compressed sensing
• A note on guaranteed sparse recovery via \(\ell_1\)-minimization
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• Sharp RIP bound for sparse signal and low-rank matrix recovery
• Convergence of projected Landweber iteration for matrix rank minimization
• Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery
• Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants
• On the Optimal Compressions in the Compress-and-Forward Relay Schemes
• Restricted isometry properties and nonconvex compressive sensing
• Decoding by Linear Programming
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• The dimension of Euclidean subspaces of quasi-normed spaces
• Shifting Inequality and Recovery of Sparse Signals
• Compressed Sensing and Affine Rank Minimization Under Restricted Isometry
• Compressed sensing: a survey
• Harmonic analysis and research on channel coding and decoding
• Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
• New Bounds for Restricted Isometry Constants
• Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
• Restricted $p$-Isometry Properties of Nonconvex Matrix Recovery