Algorithm for low-rank decomposition of partially symmetric tensors via flattening orthogonalization and shifted power method with global convergence proof.
A new convergence proof for the higher-order power method and generalizations
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
fields
math.NA 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.