Low Complexity Damped Gauss--Newton Algorithms for CANDECOMP/PARAFAC

The damped Gauss--Newton (dGN) algorithm for CANDECOMP/PARAFAC (CP) decomposition can handle the challenges of collinearity of factors and different magnitudes of factors; nevertheless, for factorization of an order-$N$ tensor of size $I_1\times\cdots\times I_N$ with rank $R$, the algorithm is compu...

Full description

Bibliographic Details

Published in:	SIAM journal on matrix analysis and applications Vol. 34; no. 1; pp. 126 - 147
Main Authors:	Phan, Anh-Huy, Tichavský, Petr, Cichocki, Andrzej
Format:	Journal Article
Language:	English
Published:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2013
Subjects:	Algorithms Approximation Complexity Computation Decomposition Inverse Inversions Mathematical analysis Tensors
ISSN:	0895-4798, 1095-7162
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!