Ablaev Seydamet Serverovich

Publications in Math-Net.Ru

1. Subgradient methods for weakly convex problems with a sharp minimum in the case of inexact information about the function or subgradient
   
   Computer Research and Modeling, 16:7 (2024),  1765–1778
2. 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
3. Subgradient methods for weakly convex and relatively weakly convex problems with a sharp minimum
   
   Computer Research and Modeling, 15:2 (2023),  393–412
4. Adaptive Subgradient Methods for Mathematical Programming Problems with Quasiconvex Functions
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 29:3 (2023),  7–25
5. 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
6. Subgradient methods for non-smooth optimization problems with some relaxation of sharp minimum
   
   Computer Research and Modeling, 14:2 (2022),  473–495
7. 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