Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme

DOI10.1137/090764827zbMath1218.65041OpenAlexW2076214866WikidataQ115247106 ScholiaQ115247106MaRDI QIDQ3008241

Lieven De Lathauwer, Mariya Ishteva, Pierre-Antoine Absil, Sabine Van Huffel

Publication date: 15 June 2011

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

Full work available at URL: https://doi.org/10.1137/090764827

zbMATH Keywords

convergence iterative algorithm numerical examples singular value decomposition Riemannian manifold Grassmann manifold multilinear algebra higher-order tensor rank reduction conjugate-gradient method trust-region scheme

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10) Multilinear algebra, tensor calculus (15A69) Local Riemannian geometry (53B20)

Related Items (33)

Further results for $Z$-eigenvalue localization theorem for higher-order tensors and their applications ⋮ Efficient alternating least squares algorithms for low multilinear rank approximation of tensors ⋮ Randomized algorithms for the approximations of Tucker and the tensor train decompositions ⋮ The Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 Tensor ⋮ Simultaneous component analysis by means of Tucker3 ⋮ Reverse-order law for core inverse of tensors ⋮ Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations ⋮ Randomized algorithms for the computation of multilinear rank-$(\mu_1,\mu_2,\mu_3)$ approximations ⋮ The average number of critical rank-one approximations to a tensor ⋮ Variational calculus with sums of elementary tensors of fixed rank ⋮ Riemannian Modified Polak--Ribière--Polyak Conjugate Gradient Order Reduced Model by Tensor Techniques ⋮ The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection ⋮ A Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on Manifolds ⋮ A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem ⋮ Hankel Tensor Decompositions and Ranks ⋮ Randomized algorithms for the low multilinear rank approximations of tensors ⋮ Exploiting Efficient Representations in Large-Scale Tensor Decompositions ⋮ The Power of Tensor-Based Approaches in Cardiac Applications ⋮ Weighted Moore-Penrose inverses of arbitrary-order tensors ⋮ Greedy low-rank approximation in Tucker format of solutions of tensor linear systems ⋮ Nonconvex weak sharp minima on Riemannian manifolds ⋮ On the convergence of higher-order orthogonal iteration ⋮ Nonlinearly Preconditioned Optimization on Grassmann Manifolds for Computing Approximate Tucker Tensor Decompositions ⋮ An efficient randomized algorithm for computing the approximate Tucker decomposition ⋮ On best rank-2 and rank-(2,2,2) approximations of order-3 tensors ⋮ Tensor neural network models for tensor singular value decompositions ⋮ High order singular value decomposition for plant diversity estimation ⋮ A Krylov-Schur-like method for computing the best rank-$(r_1,r_2,r_3)$ approximation of large and sparse tensors ⋮ Coupled Canonical Polyadic Decompositions and (Coupled) Decompositions in Multilinear Rank- $(L_{r,n},L_{r,n},1)$ Terms---Part II: Algorithms ⋮ A Riemannian gradient ascent algorithm with applications to orthogonal approximation problems of symmetric tensors ⋮ Unnamed Item ⋮ A literature survey of low-rank tensor approximation techniques ⋮ ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching

This page was built for publication: Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme