Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-$(L_r,L_r,1)$ terms and a new generalization KU Leuven
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 ...