Riemannian gradient descent methods for graph-regularized matrix completion

This publication has 24 references indexed in Scilit:

• A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
  SIAM Journal on Imaging Sciences, 2013
• The Convex Geometry of Linear Inverse Problems
  Foundations of Computational Mathematics, 2012
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
  SIAM Review, 2010
• Exact Matrix Completion via Convex Optimization
  Foundations of Computational Mathematics, 2009
• Graph spectral image smoothing using the heat kernel
  Pattern Recognition, 2008
• Diffusion wavelets
  Applied and Computational Harmonic Analysis, 2006
• Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps
  Proceedings of the National Academy of Sciences, 2005
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
  Neural Computation, 2003
• Sparse coding with an overcomplete basis set: A strategy employed by V1?
  Vision Research, 1997
• Function minimization by conjugate gradients
  The Computer Journal, 1964