Convergence of Gradient Descent for Low-Rank Matrix Approximation

DOI10.1109/TIT.2015.2448695MaRDI QIDQ2977354zbMATH OpenOpenAlexFDO

Authors Renaud-Alexandre Pitaval, Wei Dai, O. Tirkkonen

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2015.2448695

Mathematics Subject Classification ID

Information theory (general) (94A15)

Cited in

(6)

• A geometric approach to dynamical model order reduction
• Convergence of LR algorithm for a one-point spectrum tridiagonal matrix
• Convergence of a subgradient method for computing the bound norm of matrices
• Uniform rank gradient, cost, and local-global convergence
• Accelerated gradient descent algorithm with golden section search for escaping saddle points in optimization problems
• Generalized left-localized Cayley parametrization for optimization with orthogonality constraints

This page was built for publication: Convergence of Gradient Descent for Low-Rank Matrix Approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977354)