Riemannian gradient descent methods for graph-regularized matrix completion

DOI10.1016/j.laa.2020.06.010zbMath1469.90168OpenAlexW2994409951WikidataQ115344259 ScholiaQ115344259MaRDI QIDQ2029849

Shuyu Dong, Kyle A. Gallivan, Pierre-Antoine Absil

Publication date: 4 June 2021

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2020.06.010

zbMATH Keywords

matrix completionRiemannian optimizationlow-rank optimizationgraph information

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Methods of local Riemannian geometry (53B21) Matrix completion problems (15A83)

Uses Software

• Manopt
• softImpute
• GSPBOX
• MovieLens

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares
• Vertex-frequency analysis on graphs
• Graph spectral image smoothing using the heat kernel
• Introductory lectures on convex optimization. A basic course.
• The convex geometry of linear inverse problems
• Fixed-rank matrix factorizations and Riemannian low-rank optimization
• Diffusion wavelets
• Exact matrix completion via convex optimization
• Low-Rank Matrix Completion by Riemannian Optimization
• A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
• Manopt, a Matlab toolbox for optimization on manifolds
• Guaranteed Matrix Completion via Non-Convex Factorization
• Geometric Methods on Low-Rank Matrix and Tensor Manifolds
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps
• Learning Theory
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• An Introduction to Statistical Learning
• Global rates of convergence for nonconvex optimization on manifolds
• Matrix Completion From a Few Entries
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Function minimization by conjugate gradients
• Low-Rank Optimization with Trace Norm Penalty
• Low-rank matrix completion using alternating minimization
• Methods of conjugate gradients for solving linear systems