Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization
Authors:
- Laurent SorberLSLaurent Sorber
- Marc Van BarelMBMarc Van Barel
- Lieven De LathauwerLLLieven De Lathauwer
Top Cited Papers
- 1 January 2013
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 23 (2) , 695-720
Abstract
The canonical polyadic and rank-$(L_r,L_r,1)$ block term decomposition (CPD and BTD, respectively) are two closely related tensor decompositions. The CPD and, recently, BTD are important tools in psychometrics, chemometrics, neuroscience, and signal processing. We present a decomposition that generalizes these two and develop algorithms for its computation. Among these algorithms are alternating least squares schemes, several general unconstrained optimization techniques, and matrix-free nonlinear least squares methods. In the latter we exploit the structure of the Jacobian's Gramian to reduce computational and memory cost. Combined with an effective preconditioner, numerical experiments confirm that these methods are among the most efficient and robust currently available for computing the CPD, rank-$(L_r,L_r,1)$ BTD, and their generalized decomposition.Keywords
This publication has 49 references indexed in Scilit:
- Blind Separation of Exponential Polynomials and the Decomposition of a Tensor in Rank-$(L_r,L_r,1)$ TermsSIAM Journal on Matrix Analysis and Applications, 2011
- The Lifted Newton Method and Its Application in OptimizationSIAM Journal on Optimization, 2010
- Tensor decompositions, alternating least squares and other talesJournal of Chemometrics, 2009
- Efficient MATLAB Computations with Sparse and Factored TensorsSIAM Journal on Scientific Computing, 2008
- Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and UniquenessSIAM Journal on Matrix Analysis and Applications, 2008
- Decompositions of a Higher-Order Tensor in Block Terms—Part I: Lemmas for Partitioned MatricesSIAM Journal on Matrix Analysis and Applications, 2008
- A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix DiagonalizationSIAM Journal on Matrix Analysis and Applications, 2006
- The constrained total least squares technique and its applications to harmonic superresolutionIEEE Transactions on Signal Processing, 1991
- Approximate solution of the trust region problem by minimization over two-dimensional subspacesMathematical Programming, 1988
- Analysis of Individual Differences in Multidimensional Scaling Via an N-way Generalization of “Eckart-Young” DecompositionPsychometrika, 1970