A fast alternating least squares method for third-order tensors based on a compression procedure

DOI10.14495/jsiaml.7.5zbMath1448.65040OpenAlexW1966260210MaRDI QIDQ3121376

Tomonori Murakoshi, Takayasu Matsuo

Publication date: 18 March 2019

Published in: JSIAM Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.14495/jsiaml.7.5

zbMATH Keywords

canonical decompositionalternating least squaresCP decompositionthird-order tensorsparallel factors

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Numerical linear algebra (65F99)

Uses Software

• TensorToolbox
• ORL face

Cites Work

• Tensor Decompositions and Applications
• A comparison of algorithms for fitting the PARAFAC model
• Some convergence results on the regularized alternating least-squares method for tensor decomposition
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition
• Canonical Polyadic Decomposition of Third-Order Tensors: Reduction to Generalized Eigenvalue Decomposition
• Tensor rank is NP-complete

This page was built for publication: A fast alternating least squares method for third-order tensors based on a compression procedure