Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization

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 genera...

Full description

Bibliographic Details

Published in:	SIAM journal on optimization Vol. 23; no. 2; pp. 695 - 720
Main Authors:	Sorber, Laurent, Van Barel, Marc, De Lathauwer, Lieven
Format:	Journal Article
Language:	English
Published:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2013
Subjects:	Algorithms Compounding Compounds Computation Computer engineering Decomposition Least squares method Mathematical analysis Memory Optimization Optimization techniques
ISSN:	1052-6234, 1095-7189
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!