most citedGradient-free two-points optimal method for non smooth stochastic convex optimization problem with additional small noise

7 citations · 7 across the 1 of their papers we have counts for

collaborators

1 paper

math.OC2017★ 7 cited

Gradient-free two-points optimal method for non smooth stochastic convex optimization problem with additional small noise

Anastasia Bayandina, Alexander Gasnikov, Fariman Guliev +1

Using double-smoothing technique and stochastic mirror descent with inexact oracle we built an optimal algorithm (up to a multiplicative factor) for two-points gradient-free non-sm…