A new gradient projection method for matrix completion

DOI10.1016/j.amc.2015.02.041zbMath1338.15057OpenAlexW2052478776MaRDI QIDQ300199

Xi-Hong Yan, Rui-Ping Wen

Publication date: 23 June 2016

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

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

zbMATH Keywords

convergencematrix completionprojectiongradientfeasible sequence

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Numerical linear algebra (65F99) Linear preserver problems (15A86)

Related Items

A singular value thresholding with diagonal-update algorithm for low-rank matrix completion ⋮ The two-stage iteration algorithms based on the shortest distance 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 ⋮ A semi-smoothing augmented Lagrange multiplier algorithm for low-rank Toeplitz matrix completion

Uses Software

• SDPT3

Cites Work

• 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
• On the rank minimization problem over a positive semidefinite linear matrix inequality
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Signal Recovery by Proximal Forward-Backward Splitting
• Unnamed Item