[22] John Maryak and Daniel Chin. "Global random optimization by simultaneous perturbation stochastic approximation". In: Proceedings of the 2001 American Control Conference.(Cat. No. 01CH37148). Vol. 2. IEEE. 2001, pp. 756-762.
[23] Yurii Nesterov and Vladimir Spokoiny. “Random gradient-free minimization of convex functions”. In: Foundations of Computational Mathematics 17.2 (2017), pp. 527–566.
[24] Artyom Nikitin et al. "Are quantum computers practical yet? A case for feature selection in recommender systems using tensor networks". In: arXiv preprint arXiv:2205.04490 (2022).
[25] Georgii Novikov, Maxim Panov, and Ivan Oseledets. "Tensor-train density estimation". In: Uncertainty in artificial intelligence. PMLR. 2021, pp. 1321-1331.
[26] Ivan Oseledets. "Tensor-train decomposition". In: SIAM Journal on Scientific Computing 33.5 (2011), pp. 2295-2317.
[27] Ivan Oseledets and Eugene Tyrtyshnikov. “Breaking the curse of dimensionality, or how to use SVD in many dimensions”. In: SIAM Journal on Scientific Computing 31.5 (2009), pp. 3744–3759.
[28] Ivan Oseledets and Eugene Tyrtyshnikov. "TT-cross approximation for multidimensional arrays". In: Linear Algebra and its Applications 432.1 (2010), pp. 70-88.
[29] Olivier Parcollet et al. “Learning Feynman diagrams with tensor trains”. In: Bulletin of the American Physical Society (2023).
[30] Gary Parker and Ronald Rardin. Discrete optimization. Elsevier, 2014.
[31] Jun Qi et al. "Exploiting low-rank tensor-train deep neural networks based on Riemannian gradient descent with illustrations of speech processing". In: IEEE/ACM Transactions on Audio, Speech, and Language Processing 31 (2023), pp. 633-642.
[32] Gleb Ryzhakov and Ivan Oseledets. "Constructive TT-representation of the tensors given as index interaction functions with applications". In: 11th International Conference on Learning Representations, ICLR. 2023.
[33] Jonathan Scarlett, Ilija Bogunovic, and Volkan Cevher. "Lower bounds on regret for noisy gaussian process bandit optimization". In: Conference on Learning Theory. PMLR. 2017, pp. 1723-1742.
[34] Cheryl Selvanayagam et al. "Global optimization of surface warpage for inverse design of ultra-thin electronic packages using tensor train decomposition". In: IEEE Access 10 (2022), pp. 48589-48602.
[35] Suhan Shetty et al. "Tensor train for global optimization problems in robotics". In: arXiv preprint arXiv:2206.05077 (2022).
[36] Micheline Soley et al. "Global optimization with the iterative power algorithm via quantum computing and quantics tensor trains". In: Bulletin of the American Physical Society (2023).
[37] Konstantin Sozykin et al. "TTOpt: a maximum volume quantized tensor train-based optimization and its application to reinforcement learning". In: Advances in Neural Information Processing Systems. 2022.
[38] Rainer Storn and Kenneth Price. "Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces". In: Journal of Global Optimization 11.4 (1997), pp. 341-359.
[39] Christoph Strössner, Bonan Sun, and Daniel Kressner. "Approximation in the extended functional tensor train format". In: arXiv preprint arXiv:2211.11338 (2022).
[40] Minghua Wang et al. "Tensor decompositions for hyperspectral data processing in remote sensing: a comprehensive review". In: IEEE Geoscience and Remote Sensing Magazine (2023).
[41] Xiaoxing Wang et al. “ZARTS: on zero-order optimization for neural architecture search”. In: Advances in Neural Information Processing Systems 35 (2022), pp. 12868–12880.
[42] Daan Wierstra et al. "Natural evolution strategies". In: Journal of Machine Learning Research 15.27 (2014), pp. 949-980.
[43] Ronald Williams. "Simple statistical gradient-following algorithms for connectionist reinforcement learning". In: Machine learning 8.3-4 (1992), pp. 229-256.
[44] Vitaly Zankin, Gleb Ryzhakov, and Ivan Oseledets. "Gradient descent-based D-optimal design for the least-squares polynomial approximation". In: arXiv preprint arXiv:1806.06631 (2018).