A Global Convergence Analysis for Computing a Symmetric Low-Rank Orthogonal Approximation.

In this paper, we present a refined convergence analysis for a simple yet powerful method for computing a symmetric low-rank orthogonal approximation of a symmetric tensor proposed in the literature. The significance is that the assumption guaranteeing the global convergence is vastly relaxed to only on an input parameter of this algorithm. [ABSTRACT FROM AUTHOR]