(eng): Tensor Chain (TC) decomposition represents a given tensor as a chain (circle) of order-3 tensors (wagons) connected through tensor contractions. In this paper, we show the link between the TC decomposition and a structured Tucker decompositions, and propose a variant of the Krylov-Levenberg-Marquardt optimization, tailored for this problem. Many extensions can be considered, here we only mention decomposition of tensor with missing entries, which enables the tensor completion. Performance of the proposed algorithm is demonstrated on tensor decomposition of the sampled Rosenbrock function. It can be better modeled both as TC and canonical polyadic (CP) decomposition, but with TC, the reconstruction is possible with a lower number of function values.