Publications in Math-Net.Ru
-
Accelerated Bregman gradient methods for relatively smooth and relatively Lipschitz continuous minimization problems
Uspekhi Mat. Nauk, 80:6(486) (2025), 137–172
-
Adaptive primal-dual methods with an inexact oracle for relatively smooth optimization problems and their applications to recovering low-rank matrices
Zh. Vychisl. Mat. Mat. Fiz., 65:7 (2025), 1156–1177
-
On some mirror descent methods for strongly convex programming problems with Lipschitz functional constraints
Computer Research and Modeling, 16:7 (2024), 1727–1746
-
Neural networks - on awarding the Nobel Prize in Physics 2024
Taurida Journal of Computer Science Theory and Mathematics, 2024, no. 4, 34–48
-
Analogues of the relative strong convexity condition for relatively smooth problems and adaptive gradient-type methods
Computer Research and Modeling, 15:2 (2023), 413–432
-
Adaptive first-order methods for relatively strongly convex optimization problems
Computer Research and Modeling, 14:2 (2022), 445–472
© , 2026