A reweighted nuclear norm minimization algorithm for low rank matrix recovery
DOI10.1016/j.cam.2013.12.005zbMath1301.65049OpenAlexW1965356455MaRDI QIDQ2252420
Yanjiao Zhang, Yu-Fan Li, Zheng-Hai Huang
Publication date: 17 July 2014
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2013.12.005
matrix completion problemreweighted nuclear norm minimizationlow rank matrix minimizationweighted fixed point method
Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60)
Related Items (max. 100)
Uses Software
Cites Work
- An approximation theory of matrix rank minimization and its application to quadratic equations
- Fixed point and Bregman iterative methods for matrix rank minimization
- A note on the complexity of \(L _{p }\) minimization
- Restricted \(p\)-isometry property and its application for nonconvex compressive sensing
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Sparse recovery by non-convex optimization - instance optimality
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Characterization of the subdifferential of some matrix norms
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Nonsmooth analysis of singular values. I: Theory
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- EXACT LOW-RANK MATRIX RECOVERY VIA NONCONVEX SCHATTEN p-MINIMIZATION
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
- Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization
- Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
- Restricted isometry properties and nonconvex compressive sensing
- Decoding by Linear Programming
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Iteratively reweighted least squares minimization for sparse recovery
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- On the Performance of Sparse Recovery Via $\ell_p$-Minimization $(0 \leq p \leq 1)$
- Restricted $p$-Isometry Properties of Nonconvex Matrix Recovery
This page was built for publication: A reweighted nuclear norm minimization algorithm for low rank matrix recovery