Riemannian gradient descent methods for graph-regularized matrix completion
type: Item
instance of: scholarly article
title: Riemannian gradient descent methods for graph-regularized matrix completion
zbMATH Open document ID: 1469.90168
author: Shuyu Dong
author: P.-A. Absil
author: K. A. Gallivan
published in: Linear Algebra and its Applications
publication date: 2021-06-04T00:00:00Z
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 53B21
Mathematics Subject Classification ID: 15A83
zbMATH DE Number: 7355237
zbMATH Keywords: matrix completion
zbMATH Keywords: graph information
zbMATH Keywords: Riemannian optimization
zbMATH Keywords: low-rank optimization
Wikidata QID: Q115344259
describes a project that uses: GSPBOX
describes a project that uses: Manopt
describes a project that uses: MovieLens
describes a project that uses: softImpute
MaRDI profile type: Publication
full work available at URL: j.laa.2020.06.010
OpenAlex ID: W2994409951
cites work: Learning Theory
cites work: Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
cites work: Global rates of convergence for nonconvex optimization on manifolds
cites work: Manopt, a Matlab toolbox for optimization on manifolds
cites work: Exact matrix completion via convex optimization
cites work: The Power of Convex Relaxation: Near-Optimal Matrix Completion
cites work: The convex geometry of linear inverse problems
cites work: Fast approximate \(k\)NN graph construction for high dimensional data via recursive Lanczos bisection
cites work: Q5691133
cites work: Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps
cites work: Diffusion wavelets
cites work: Function minimization by conjugate gradients
cites work: Q5479892
cites work: Matrix completion and low-rank SVD via fast alternating least squares
cites work: Methods of conjugate gradients for solving linear systems
cites work: Low-rank matrix completion using alternating minimization
cites work: An Introduction to Statistical Learning
cites work: Matrix Completion From a Few Entries
cites work: Online learning for matrix factorization and sparse coding
cites work: Spectral regularization algorithms for learning large incomplete matrices
cites work: Low-Rank Optimization with Trace Norm Penalty
cites work: Fixed-rank matrix factorizations and Riemannian low-rank optimization
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Q5563083
cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
cites work: Vertex-frequency analysis on graphs
cites work: Guaranteed Matrix Completion via Non-Convex Factorization
cites work: Geometric Methods on Low-Rank Matrix and Tensor Manifolds
cites work: Low-rank matrix completion by Riemannian optimization
cites work: A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
cites work: Graph spectral image smoothing using the heat kernel
DOI: 10.1016/J.LAA.2020.06.010
description: scientific article; zbMATH DE number 7355237