A new convergence proof for the higher-order power method and generalizations
classification
🧮 math.OC
math.NA
keywords
convergencehigher-ordermethodpowerproofalgorithmalternatingapplying
read the original abstract
A proof for the point-wise convergence of the factors in the higher-order power method for tensors towards a critical point is given. It is obtained by applying established results from the theory of \L{}ojasiewicz inequalities to the equivalent, unconstrained alternating least squares algorithm for best rank-one tensor approximation.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Multi-subspace power method for decomposing partially symmetric tensors
Algorithm for low-rank decomposition of partially symmetric tensors via flattening orthogonalization and shifted power method with global convergence proof.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.