Abstract
The canonical tensor rank approximation problem (TAP) consists of approximating a real-valued tensor by one of low canonical rank, which is a challenging nonlinear, nonconvex, constrained optimization problem, where the constraint set forms a nonsmooth semialgebraic set. We introduce a Riemannian Gauss--Newton method with trust region for solving small-scale, dense TAPs. The novelty of our approach is threefold. First, we parametrize the constraint set as the Cartesian product of Segre manifolds, hereby formulating the TAP as a Riemannian optimization problem, and we argue why this parametrization is theoretically a good choice. Second, an original sequentially truncated higher-order singular value decomposition (ST-HOSVD) based retraction operator is proposed. Third, we introduce a hot restart mechanism that efficiently detects when the optimization process is tending to an ill-conditioned tensor rank decomposition and that often yields a quick escape path from such spurious decompositions. Numerical exp...
Funding Information
  • Deutsche Forschungsgemeinschaft (BU 1371/2-2)
  • Fonds Wetenschappelijk Onderzoek

This publication has 58 references indexed in Scilit: