|
|
Publications in Math-Net.Ru
-
Survey of modern smooth optimization algorithms with comparison oracle
Dokl. RAN. Math. Inf. Proc. Upr., 526 (2025), 16–23
-
Asymptotic Analysis of the Ruppert – Polyak Averaging for Stochastic Order Oracle
Rus. J. Nonlin. Dyn., 20:5 (2024), 961–978
-
On Quasi-Convex Smooth Optimization Problems by a Comparison Oracle
Rus. J. Nonlin. Dyn., 20:5 (2024), 813–825
-
Accelerated Zero-Order SGD under High-Order Smoothness and Overparameterized Regime
Rus. J. Nonlin. Dyn., 20:5 (2024), 759–788
-
Improved maximum noise level estimation in black-box optimization problems
Zap. Nauchn. Sem. POMI, 540 (2024), 132–147
-
Highly smooth zeroth-order methods for solving optimization problems under the PL condition
Zh. Vychisl. Mat. Mat. Fiz., 64:4 (2024), 739–770
-
On some works of Boris Teodorovich Polyak on the convergence of gradient methods and their development
Zh. Vychisl. Mat. Mat. Fiz., 64:4 (2024), 587–626
-
Distributed min-max optimization using the smoothing technique
Computer Research and Modeling, 15:2 (2023), 469–480
-
Influence of the mantissa finiteness on the accuracy of gradient-free optimization methods
Computer Research and Modeling, 15:2 (2023), 259–280
-
Gradient-free federated learning methods with $l_1$ and $l_2$-randomization for non-smooth convex stochastic optimization problems
Zh. Vychisl. Mat. Mat. Fiz., 63:9 (2023), 1458–1512
-
Mini-batch adaptive random search method for the parametric identification of dynamic systems
Avtomat. i Telemekh., 2020, no. 11, 112–135
© , 2026