LSSC 2019: Large-Scale Scientific Computing pp 197-202

# Global Optimization Algorithms Using Tensor Trains

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11958)

## Abstract

Global optimization problem arises in a huge amount of applications including parameter estimation of different models, molecular biology, drug design and many others. There are several types of methods for this problem: deterministic, stochastic, heuristic and metaheuristic. Deterministic methods guarantee that found solution is the global optima, but complexity of such methods allows to use them only for problems of relatively small dimensionality, simple functional and area of optimization.

Non-deterministic methods are based on some simple models of stochastic, physical, biological and other processes. On practice such methods are often much faster then direct methods. But for the most of them there is no proof of such fast convergence even for some simple cases.

In this paper we consider global optimization method based on tensor train decomposition. The method is non-deterministic and exploits tensor structure of functional. Theoretical results proving its fast convergence in some simple cases to global optimum are provided.

## References

1. 1.
Goreinov, S.A., Tyrtyshnikov, E.E., Zamarashkin, N.L.: A theory of pseudo-skeleton approximations. Linear Algebra Appl. 261(1–3), 1–21 (1997)
2. 2.
Tyrtyshnikov, E.E.: Incomplete cross approximation in the mosaic-skeleton method. Computing 64(4), 367–380 (2000)
3. 3.
Goreinov, S.A., Tyrtyshnikov, E.E.: The maximal-volume concept in approximation by low-rank matrices. Contemp. Math. 208, 47–51 (2001)
4. 4.
Goreinov, S.A., Oseledets, I.V., Savostyanov, D.V., Tyrtyshnikov, E.E., Zamarashkin, N.L.: How to find a good submatrix. In: Olshevsky, V., Tyrtyshnikov, E. (eds.) Matrix Methods: Theory, Algorithms, Applications, pp. 247–256. World Scientific, Hackensack (2010)
5. 5.
Oseledets, I.V., Tyrtyshnikov, E.E.: Breaking the curse of dimensionality, or how to use SVD in many dimensions. SIAM J. Sci. Comput. 31(5), 3744–3759 (2009)
6. 6.
Oseledets, I.V.: Tensor-train decomposition. SIAM J. Sci. Comput. 33(5), 2295–2317 (2011)
7. 7.
Oseledets, I.V., Tyrtyshnikov, E.E.: TT-cross approximation for multidimensional arrays. Linear Algebra Appl. 432(1), 70–88 (2010)
8. 8.
Osinsky A.I.: Probabilistic estimation of the rank-1 cross approximation accuracy. arXiv preprint arXiv:1706.10285 (2017)
9. 9.
Zheltkova, V.V., Zheltkov, D.A., Grossman, Z., Bocharov, G.A., Tyrtyshnikov, E.E.: Tensor based approach to the numerical treatment of the parameter estimation problems in mathematical immunology. J. Inverse Ill-posed Prob. 26(1), 51–66 (2008)
10. 10.
Sulimov, A.V., et al.: Evaluation of the novel algorithm of flexible ligand docking with moveable target-protein atoms. Comput. Struct. Biotechnol. J. 15, 275–285 (2017)