The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion

DOI10.1016/j.amc.2017.07.024zbMath1426.65058OpenAlexW2735864499MaRDI QIDQ1740089

Rui-Ping Wen, Li-Xia Liu

Publication date: 29 April 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2017.07.024

zbMATH Keywords

distancelow-rank matrix completiontwo-stage iterationalternating steepest descent algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Iterative numerical methods for linear systems (65F10) Matrix completion problems (15A83)

Related Items

LANDSCAPE ARCHITECTURE CONSTRUCTION USING LANDSCAPE URBANISM AND DYNAMIC NONLINEAR SYSTEM THINKING, Accelerated low rank matrix approximate algorithms for matrix completion, A singular value thresholding with diagonal-update algorithm for low-rank matrix completion, Toeplitz matrix completion via smoothing augmented Lagrange multiplier algorithm, A new method based on the manifold-alternative approximating for low-rank matrix completion, Toeplitz matrix completion via a low-rank approximation algorithm

Uses Software

• LMaFit
• RTRMC

Cites Work

• Unnamed Item
• A new gradient projection method for matrix completion
• Low rank matrix completion by alternating steepest descent methods
• 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
• Low-Rank Matrix Completion by Riemannian Optimization
• A Singular Value Thresholding Algorithm for Matrix Completion
• Matrix completion via an alternating direction method
• The complexity of matrix completion
• Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
• On the rank minimization problem over a positive semidefinite linear matrix inequality
• CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
• Low-rank matrix completion using alternating minimization