Riemannian preconditioned coordinate descent for low multilinear rank approximation

DOI10.1137/21M1463896MaRDI QIDQ6561638FDO

Authors Mohammad Abu Hamed, Reshad Hosseini

Publication date 25 June 2024

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

preconditioningcoordinate descentTucker decompositionRiemannian metricRiemannian optimization

Mathematics Subject Classification ID

Differential geometric aspects in vector and tensor analysis (53A45) Numerical linear algebra (65Fxx) Mathematical programming (90Cxx)

Recommendations

• Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme
• New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition
• Low-rank tensor completion by Riemannian optimization
• The Best rank-\((R_1,R_2,R_3)\) approximation of tensors by means of a geometric Newton method
• Riemannian optimization for high-dimensional tensor completion

Cites work

• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• A Multilinear Singular Value Decomposition
• A Newton-Grassmann method for computing the best multilinear rank-\((r_1,r_2,r_3)\) approximation of a tensor
• A new truncation strategy for the higher-order singular value decomposition
• Algorithms for Sparse Nonnegative Tucker Decompositions
• An Introduction to Optimization on Smooth Manifolds
• Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme
• Coordinate Descent Without Coordinates: Tangent Subspace Descent on Riemannian Manifolds
• Coordinate descent algorithms
• Global rates of convergence for nonconvex optimization on manifolds
• Hierarchical Singular Value Decomposition of Tensors
• Inexact coordinate descent: complexity and preconditioning
• Low-rank Tucker approximation of a tensor from streaming data
• Low-rank tensor completion by Riemannian optimization
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• On the convergence of block coordinate descent type methods
• On the convergence of higher-order orthogonal iteration
• Quasi-Newton methods on Grassmannians and multilinear approximations of tensors
• Randomized algorithms for the approximations of Tucker and the tensor train decompositions
• Ranks derived from multilinear maps
• Riemannian preconditioning
• Tensor Decomposition for Signal Processing and Machine Learning
• Tensor Decompositions and Applications

This page was built for publication: Riemannian preconditioned coordinate descent for low multilinear rank approximation

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