Homotopy method for matrix rank minimization based on the matrix hard thresholding method
From MaRDI portal
Publication:2273119
DOI10.3934/naco.2019015zbMath1442.65080OpenAlexW2911326460MaRDI QIDQ2273119
Zhengshan Dong, Wen-Xing Zhu, Jian-Li Chen
Publication date: 18 September 2019
Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/naco.2019015
matrix completionhomotopy methoditerative hard thresholding methodmatrix rank minimizationhard thresholding operator
Combinatorial optimization (90C27) Inverse problems in linear algebra (15A29) Numerical linear algebra (65F99)
Uses Software
Cites Work
- Unnamed Item
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
- Convergence of fixed-point continuation algorithms for matrix rank minimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- Iterative thresholding for sparse approximations
- Fused Lasso penalized least absolute deviation estimator for high dimensional linear regression
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Matrix recipes for hard thresholding methods
- Exact matrix completion via convex optimization
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization
- Normalized Iterative Hard Thresholding for Matrix Completion
- Penalty decomposition methods for rank minimization
- The complexity of matrix completion
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
This page was built for publication: Homotopy method for matrix rank minimization based on the matrix hard thresholding method
