Matrix completion via minimizing an approximate rank
From MaRDI portal
Publication:5236743
DOI10.1142/S0219530519400025zbMath1425.65057OpenAlexW2953834167WikidataQ127552561 ScholiaQ127552561MaRDI QIDQ5236743
Jian Lu, Yuesheng Xu, Xueying Zeng, Li-Xin Shen
Publication date: 10 October 2019
Published in: Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219530519400025
Ill-posedness and regularization problems in numerical linear algebra (65F22) Approximation algorithms (68W25) Inverse problems in optimal control (49N45)
Related Items (2)
Multitemporal image cloud removal using group sparsity and nonconvex low-rank approximation ⋮ Sparse regularization with the ℓ0 norm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Wavelet inpainting with the \(\ell_{0}\) sparse regularization
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Fixed point and Bregman iterative methods for matrix rank minimization
- Iterative hard thresholding for compressed sensing
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Matrix recipes for hard thresholding methods
- Exact matrix completion via convex optimization
- Guarantees of Riemannian Optimization for Low Rank Matrix Recovery
- Normalized Iterative Hard Thresholding for Matrix Completion
- Penalty decomposition methods for rank minimization
- Guaranteed Matrix Completion via Non-Convex Factorization
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- A Singular Value Thresholding Algorithm for Matrix Completion
- The Split Bregman Method for L1-Regularized Problems
- Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
- Recovery of Low-Rank Matrices Under Affine Constraints via a Smoothed Rank Function
- Iterative Concave Rank Approximation for Recovering Low-Rank Matrices
- Multiview Matrix Completion for Multilabel Image Classification
- Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
- Global Optimality in Low-Rank Matrix Optimization
- A Statistical View of Some Chemometrics Regression Tools
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Low-rank matrix completion using alternating minimization
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Matrix completion via minimizing an approximate rank
