Proximal iteratively reweighted algorithm for low-rank matrix recovery
From MaRDI portal
Publication:1691320
DOI10.1186/s13660-017-1602-xzbMath1391.90477OpenAlexW2782998807WikidataQ47556753 ScholiaQ47556753MaRDI QIDQ1691320
Publication date: 15 January 2018
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-017-1602-x
compressed sensingmatrix rank minimizationreweighted nuclear norm minimizationSchatten-\(p\) quasi-norm minimization
Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Cites Work
- Unnamed Item
- Unnamed Item
- Exact minimum rank approximation via Schatten \(p\)-norm minimization
- Null space conditions and thresholds for rank minimization
- A reweighted nuclear norm minimization algorithm for low rank matrix recovery
- Exact matrix completion via convex optimization
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- 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
- Smoothed Low Rank and Sparse Matrix Recovery by Iteratively Reweighted Least Squares Minimization
- Restricted $p$-Isometry Properties of Nonconvex Matrix Recovery
This page was built for publication: Proximal iteratively reweighted algorithm for low-rank matrix recovery