Some convergence results on the Regularized Alternating Least-Squares method for tensor decomposition

Academic Article

Abstract

  • We study the convergence of the Regularized Alternating Least-Squares algorithm for tensor decompositions. As a main result, we have shown 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. Some numerical examples indicate a faster convergence rate for the RALS in comparison to the usual Alternating Least-Squares method. © 2011 Elsevier Inc. All rights reserved.
  • Published In

    Digital Object Identifier (doi)

    Start Page

  • 796
  • End Page

  • 812
  • Volume

  • 438
  • Issue

  • 2