|
|
Publications in Math-Net.Ru
-
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
-
Subgradient methods for weakly convex and relatively weakly convex problems with a sharp minimum
Computer Research and Modeling, 15:2 (2023), 393–412
-
On mirror descent methods for some types of composite optimization problems with functional constraints
Taurida Journal of Computer Science Theory and Mathematics, 2023, no. 3, 7–18
-
Subgradient methods for non-smooth optimization problems with some relaxation of sharp minimum
Computer Research and Modeling, 14:2 (2022), 473–495
-
Adaptive gradient-type methods for optimization problems with relative error and sharp minimum
Trudy Inst. Mat. i Mekh. UrO RAN, 27:4 (2021), 175–188
-
On some algorithms for constrained optimization problems with relative accuracy with respect to the objective functional
Trudy Inst. Mat. i Mekh. UrO RAN, 26:3 (2020), 198–210
-
Introduction to sublinear analysis – 2: symmetric case
CMFD, 57 (2015), 108–161
© , 2024