A new method based on the manifold-alternative approximating for low-rank matrix completion
From MaRDI portal
Publication:2061479
DOI10.1186/s13660-018-1931-4zbMath1498.65060OpenAlexW2904045308WikidataQ60303384 ScholiaQ60303384MaRDI QIDQ2061479
Publication date: 15 December 2021
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-018-1931-4
Convex programming (90C25) Matrix completion problems (15A83) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Cites Work
- Unnamed Item
- Unnamed Item
- A new gradient projection method for matrix completion
- Low rank matrix completion by alternating steepest descent methods
- Characterization of the subdifferential of some matrix norms
- 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
- Matrix recipes for hard thresholding methods
- Exact matrix completion via convex optimization
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- Low-Rank Matrix Completion by Riemannian Optimization
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- A Singular Value Thresholding Algorithm for Matrix Completion
- 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
- On the rank minimization problem over a positive semidefinite linear matrix inequality
- Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Signal Recovery by Proximal Forward-Backward Splitting
- Low-rank matrix completion using alternating minimization
