A universal rank approximation method for matrix completion
From MaRDI portal
Publication:5097888
DOI10.1142/S0219691322500163OpenAlexW4280643530WikidataQ114072393 ScholiaQ114072393MaRDI QIDQ5097888
Feilong Cao, Jinyao Yan, Hailiang Ye, Xin-Hong Meng
Publication date: 1 September 2022
Published in: International Journal of Wavelets, Multiresolution and Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219691322500163
Computing methodologies for image processing (68U10) Approximation algorithms (68W25) Machine vision and scene understanding (68T45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- A Riemannian rank-adaptive method for low-rank matrix completion
- Weighted nuclear norm minimization and its applications to low level vision
- A singular value thresholding with diagonal-update algorithm for low-rank matrix completion
- Exact matrix completion via convex optimization
- A Singular Value Thresholding Algorithm for Matrix Completion
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- A Truncated Nuclear Norm Regularization Method Based on Weighted Residual Error for Matrix Completion
- Light Field Inpainting Propagation via Low Rank Matrix Completion
- Nonlinear Low-Rank Matrix Completion for Human Motion Recovery
- Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization
- A Deterministic Theory of Low Rank Matrix Completion
- A Hybrid Truncated Norm Regularization Method for Matrix Completion
- Matrix Completion and Extrapolation via Kernel Regression
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
This page was built for publication: A universal rank approximation method for matrix completion
