On global convergence of alternating least squares for tensor approximation

Alternating least squares is a classic, easily implemented, yet widely used method for tensor canonical polyadic approximation. Its subsequential and global convergence is ensured if the partial Hessians of the blocks during the whole sequence are uniformly positive definite. This paper shows that this positive definiteness assumption can be weakened in two ways. Firstly, if the smallest positive eigenvalues of the partial Hessians are uniformly positive, and the solutions of the subproblems are properly chosen, then global convergence holds. This allows the partial Hessians to be only positive semidefinite. Next, if at a limit point, the partial Hessians are positive definite, then global convergence also holds. We also discuss the connection of such an assumption to the uniqueness of exact CP decomposition.

Automated summary

This paper investigates the application of alternating least squares in tensor canonical polyadic approximation. It demonstrates alternative conditions for global convergence by weakening the positive definiteness assumption and discusses its connection to the uniqueness of exact CP decomposition.