Accelerated low rank matrix approximate algorithms for matrix completion
From MaRDI portal
Publication:2203735
DOI10.1016/j.camwa.2018.09.037zbMath1442.65083OpenAlexW2897441097MaRDI QIDQ2203735
Jin Wang, Chuan-Long Wang, Zhi Xu, Yan-Ping Wang
Publication date: 2 October 2020
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2018.09.037
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Fixed point and Bregman iterative methods for matrix rank minimization
- Low rank matrix completion by alternating steepest descent methods
- The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Fast singular value thresholding without singular value decomposition
- Exact matrix completion via convex optimization
- Low-Rank Matrix Completion by Riemannian Optimization
- A Singular Value Thresholding Algorithm for Matrix Completion
- Matrix completion via an alternating direction method
- On the rank minimization problem over a positive semidefinite linear matrix inequality
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion
- Low-rank matrix completion using alternating minimization