A Newton–Grassmann Method for Computing the Best Multilinear Rank-$(r_1,$ $r_2,$ $r_3)$ Approximation of a Tensor

DOI10.1137/070688316zbMath1205.65161OpenAlexW2036718271MaRDI QIDQ3561155

Berkant Savas, Lars Eldén

Publication date: 25 May 2010

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

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

zbMATH Keywords

computational complexitynumerical experimentsquadratic convergenceNewton methodGrassmann manifoldmultilinear rankbest multilinear rank approximationTensor aproximation

Mathematics Subject Classification ID

Related Items (39)

Efficient alternating least squares algorithms for low multilinear rank approximation of tensors ⋮ Linear algebra for tensor problems ⋮ Randomized algorithms for the approximations of Tucker and the tensor train decompositions ⋮ Optimization landscape of Tucker decomposition ⋮ Topology of tensor ranks ⋮ Krylov-type methods for tensor computations.I ⋮ 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 ⋮ Some norm inequalities for commutators of contracted tensor products ⋮ A gradual rank increasing process for matrix completion ⋮ Tensor Approximation for Multidimensional and Multivariate Data ⋮ A tensor decomposition approach to data compression and approximation of ND systems ⋮ Minimality of tensors of fixed multilinear rank ⋮ 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 ⋮ On manifolds of tensors of fixed TT-rank ⋮ Randomized algorithms for the low multilinear rank approximations of tensors ⋮ On optimal low rank Tucker approximation for tensors: the case for an adjustable core size ⋮ Greedy low-rank approximation in Tucker format of solutions of tensor linear systems ⋮ Classification of hyperspectral images by tensor modeling and additive morphological decomposition ⋮ Diagonalization of tensors with circulant structure ⋮ Fast Hankel tensor–vector product and its application to exponential data fitting ⋮ On polynomial time methods for exact low-rank tensor completion ⋮ GRADIENT FLOWS FOR OPTIMIZATION IN QUANTUM INFORMATION AND QUANTUM DYNAMICS: FOUNDATIONS AND APPLICATIONS ⋮ Numerical tensor calculus ⋮ 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 ⋮ Tensor neural network models for tensor singular value decompositions ⋮ Even-order Toeplitz tensor: framework for multidimensional structured linear systems ⋮ A Krylov-Schur-like method for computing the best rank-\((r_1,r_2,r_3)\) approximation of large and sparse tensors ⋮ Unnamed Item ⋮ Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking ⋮ Frobenius norm inequalities of commutators based on different products ⋮ A literature survey of low-rank tensor approximation techniques ⋮ Classification of sub-Cuntz states ⋮ Optimization on the hierarchical Tucker manifold - applications to tensor completion ⋮ ISLET: Fast and Optimal Low-Rank Tensor Regression via Importance Sketching

Uses Software

• TensorToolbox
• Algorithm 862

This page was built for publication: A Newton–Grassmann Method for Computing the Best Multilinear Rank-$(r_1,$ $r_2,$ $r_3)$ Approximation of a Tensor