Some Convergence Results on the Regularized Alternating Least-Squares Method for Tensor Decomposition

Details Some Convergence Results on the Regularized Alternating Least-Squares Method for Tensor Decomposition Some Convergence Results on the Regularized Alternating Least-Squares Method for Tensor Decomposition

2011-09-18

arxiv.org/abs/1109.3831v1

Mathematics

Numerical Analysis

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Some Convergence Results on the Regularized Alternating Least-Squares Method for Tensor Decomposition does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Some Convergence Results on the Regularized Alternating Least-Squares Method for Tensor Decomposition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some Convergence Results on the Regularized Alternating Least-Squares Method for Tensor Decomposition will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-560193