Some convergence results on the regularized alternating least-squares method for tensor decomposition (Q1931768): Difference between revisions
From MaRDI portal
Latest revision as of 03:02, 6 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some convergence results on the regularized alternating least-squares method for tensor decomposition |
scientific article |
Statements
Some convergence results on the regularized alternating least-squares method for tensor decomposition (English)
0 references
16 January 2013
0 references
The authors analyse the convergence of the regularized alternating least-squares (RALS) algorithm for tensor decompositions. They show that given the existence of critical points of the alternating least-squares method, the limit points of the converging subsequences of the RALS are the critical points of the least squares cost functional.
0 references
tensor decomposition
0 references
nonlinear optimization
0 references
convergence
0 references
algorithm
0 references
alternating least-squares
0 references
0 references
0 references
0 references
0 references
