Symmetric tensor decomposition by alternating gradient descent

The symmetric tensor decomposition problem is a fundamental problem in many fields, which appealing for investigation. In general, greedy algorithm is used for tensor decomposition. That is, we first find the largest singular value and singular vector and subtract the corresponding component from te...

Full description

Bibliographic Details

Published in:	Numerical linear algebra with applications Vol. 29; no. 1
Main Author:	Liu, Haixia
Format:	Journal Article
Language:	English
Published:	Oxford Wiley Subscription Services, Inc 01.01.2022
Subjects:	Algorithms alternating minimization Convergence CP rank Decomposition gradient descent Greedy algorithms linear convergence Mathematical analysis Optimization symmetric tensor decomposition Tensors
ISSN:	1070-5325, 1099-1506
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!