A regularized Newton method for the efficient approximation of tensors represented in the canonical tensor format (Q1938432): Difference between revisions

In the introduction the authors ``consider a rank approximation algorithm for tensors represented in the canonical format in arbitrary pre-Hilbert tensor product spaces. It is shown that the original approximation problem is equivalent to a finite-dimensional \(l_2\) minimization problem. The \(l_2\) minimization problem is solved by a regularized Newton method which requires the computation and evaluation of the first and second derivative of the objective function. A systematic choice of the initial guess for the iterative scheme is introduced. The effectiveness of the approach is demonstrated in numerical experiments.''