Structure of the Hessian matrix and an economical implementation of Newton’s method in the problem of canonical approximation of tensors
From MaRDI portal
Publication:2995922
DOI10.1134/S0965542510060011zbMath1224.65117MaRDI QIDQ2995922
Vladimir A. Kazeev, Evgenij E. Tyrtyshnikov
Publication date: 4 May 2011
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542510060011
preconditioning; conjugate gradient method; canonical decomposition; tensor decomposition; Hessian matrix; low rank approximations; trust region Newton method
65K05: Numerical mathematical programming methods
90C51: Interior-point methods
65F10: Iterative numerical methods for linear systems
15A69: Multilinear algebra, tensor calculus
65F08: Preconditioners for iterative methods
Related Items
Use of tensor formats in elliptic eigenvalue problems, The Dynamics of Swamps in the Canonical Tensor Approximation Problem, A Derivative-Free Nonlinear Least Squares Solver, A literature survey of low-rank tensor approximation techniques, The Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 Tensor