Canonical Polyadic Decomposition with a Columnwise Orthonormal Factor Matrix

DOI10.1137/110830034zbMath1263.15011OpenAlexW2019219605MaRDI QIDQ4918161

Pierre Comon, Lieven De Lathauwer, Mikael Sørensen, Luc Deneire, Sylvie Icart

Publication date: 23 April 2013

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

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

zbMATH Keywords

orthogonalityhigher-order tensoralternating least squaressimultaneous matrix diagonalizationcanonical decomposition (CANDECOMP)polyadic decompositionparallel factor (PARAFAC)

Mathematics Subject Classification ID

Vector and tensor algebra, theory of invariants (15A72) Inverse problems in linear algebra (15A29) Multilinear algebra, tensor calculus (15A69) Canonical forms, reductions, classification (15A21)

Related Items (17)

The Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 Tensor ⋮ Explicit calculation of singular integrals of tensorial polyadic kernels ⋮ On approximation algorithm for orthogonal low-rank tensor approximation ⋮ New Uniqueness Conditions for the Canonical Polyadic Decomposition of Third-Order Tensors ⋮ Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations ⋮ Half-quadratic alternating direction method of multipliers for robust orthogonal tensor approximation ⋮ Constrained Optimization with Low-Rank Tensors and Applications to Parametric Problems with PDEs ⋮ Rank properties and computational methods for orthogonal tensor decompositions ⋮ On Best Low Rank Approximation of Positive Definite Tensors ⋮ Trace maximization algorithm for the approximate tensor diagonalization ⋮ The Epsilon-Alternating Least Squares for Orthogonal Low-Rank Tensor Approximation and Its Global Convergence ⋮ A note on nonclosed tensor formats ⋮ Numerical tensor calculus ⋮ A Low-Rank Tensor Method for PDE-Constrained Optimization with Isogeometric Analysis ⋮ Unfoldings and the rank-one approximation of the tensor ⋮ Numerical Computation for Orthogonal Low-Rank Approximation of Tensors ⋮ Guarantees for Existence of a Best Canonical Polyadic Approximation of a Noisy Low-Rank Tensor

This page was built for publication: Canonical Polyadic Decomposition with a Columnwise Orthonormal Factor Matrix