12 citations · 25 across the 5 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
math.OC2022★ 2 cited
Stochastic Gradient Methods with Preconditioned Updates
Abdurakhmon Sadiev, Aleksandr Beznosikov, Abdulla Jasem Almansoori +3
This work considers the non-convex finite sum minimization problem. There are several algorithms for such problems, but existing methods often work poorly when the problem is badly…
math.OC2022★ 12 cited
The Power of First-Order Smooth Optimization for Black-Box Non-Smooth Problems
Alexander Gasnikov, Anton Novitskii, Vasilii Novitskii +6
Gradient-free/zeroth-order methods for black-box convex optimization have been extensively studied in the last decade with the main focus on oracle calls complexity. In this paper,…