Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery
From MaRDI portal
Publication:2515314
DOI10.1007/s11425-014-4949-1zbMath1331.65183OpenAlexW2255041119MaRDI QIDQ2515314
Publication date: 31 July 2015
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-014-4949-1
restricted isometry propertylow rank matrix recoveryprojected gradient descentnonconvex matrix recovery
Convex programming (90C25) Complexity and performance of numerical algorithms (65Y20) Numerical linear algebra (65F99) Matrix completion problems (15A83)
Related Items (5)
Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery ⋮ Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization ⋮ A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit ⋮ Minimization of the difference of Nuclear and Frobenius norms for noisy low rank matrix recovery ⋮ Weighted lp − l1 minimization methods for block sparse recovery and rank minimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The bounds of restricted isometry constants for low rank matrices recovery
- Exact minimum rank approximation via Schatten \(p\)-norm minimization
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- Projected Landweber iteration for matrix completion
- Iterative hard thresholding for compressed sensing
- Iterative thresholding for sparse approximations
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- A unifying analysis of projected gradient descent for \(\ell_p\)-constrained least squares
- 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
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants
- A Singular Value Thresholding Algorithm for Matrix Completion
- A remark on global positioning from local distances
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- On $l_q$ Optimization and Matrix Completion
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- ADMiRA: Atomic Decomposition for Minimum Rank Approximation
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Restricted $p$-Isometry Properties of Nonconvex Matrix Recovery
This page was built for publication: Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery
