Egor Gladin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Egor Gladin has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Alexander Gasnikov
Moscow Institute of Physics and Technology
3 shared publications - Pavel Dvurechensky
Weierstrass Institute for Applied Analysis and Stochastics Mohrenstr. 39 10117 Berlin Germany
2 shared publications - Abdurakhmon Sadiev
Moscow Institute of Physics and Technology
1 shared publication - Aleksandr Beznosikov
Basic Research of Artificial Intelligence Laboratory (BRAIn Lab), Moscow Independent Research Institute of Artificial Intelligence, Moscow, Russia
1 shared publication Elena Ermakova
1 shared publication- Mohammad Alkousa
Innopolis University, Innopolis, Russia
1 shared publication
Latest Publications
- 24 December 2024
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 204 (1) , 1-23
Accuracy Certificates for Convex Minimization with Inexact Oracle
- 24 December 2024
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 204 (1) , 1-23
Accuracy Certificates for Convex Minimization with Inexact Oracle
- Open Access
Vaidya's method for convex stochastic optimization in small dimension
This paper considers a general problem of convex stochastic optimization in a relatively low-dimensional space (e.g., 100 variables). It is known that for deterministic convex optimization problems of small dimensions, the fastest convergence is achieved by the center of gravity type methods (e.g., Vaidya's cutting plane method). For stochastic optimization problems, the question of whether Vaidya's method can be used comes down to the question of how it accumulates inaccuracy in the subgradient. The recent result of the authors states that the errors do not accumulate on iterations of Vaidya's method, which allows proposing its analog for stochastic optimization problems. The primary technique is to replace the subgradient in Vaidya's method with its probabilistic counterpart (the arithmetic mean of the stochastic subgradients). The present paper implements the described plan, which ultimately leads to an effective (if parallel computations for batching are possible) method for solving convex stochastic optimization problems in relatively low-dimensional spaces.
Open AccessVaidya's method for convex stochastic optimization in small dimension
This paper considers a general problem of convex stochastic optimization in a relatively low-dimensional space (e.g., 100 variables). It is known that for deterministic convex optimization problems of small dimensions, the fastest convergence is achieved by the center of gravity type methods (e.g., Vaidya's cutting plane method). For stochastic optimization problems, the question of whether Vaidya's method can be used comes down to the question of how it accumulates inaccuracy in the subgradient. The recent result of the authors states that the errors do not accumulate on iterations of Vaidya's method, which allows proposing its analog for stochastic optimization problems. The primary technique is to replace the subgradient in Vaidya's method with its probabilistic counterpart (the arithmetic mean of the stochastic subgradients). The present paper implements the described plan, which ultimately leads to an effective (if parallel computations for batching are possible) method for solving convex stochastic optimization problems in relatively low-dimensional spaces.
- 21 September 2021
- Published by Springer Nature
- p. 19-40
Solving Smooth Min-Min and Min-Max Problems by Mixed Oracle Algorithms
- 21 September 2021
- Published by Springer Nature
- p. 19-40
Solving Smooth Min-Min and Min-Max Problems by Mixed Oracle Algorithms