Mirror version of similar triangles method for constrained optimization problems

Built on

Введение в оптимизацию
Борис Теодорович Поляк · 1983
Earlier work this paper cites.
Mirror descent and nonlinear projected subgradient methods for convex optimization
Amir Beck and Marc Teboulle · 2003
Earlier work this paper cites.
Bregman distance to l1 regularized logistic regression
Mithun Das Gupta and Thomas S Huang · 2008
Earlier work this paper cites.
Large deviations of vector-valued martingales in 2-smooth normed spaces
Original
Anatoli Juditsky and Arkadii S Nemirovski · 2008
Earlier work this paper cites.
Primal-dual subgradient methods for convex problems
Original
Yurii Nesterov · 2009
Earlier work this paper cites.

Методы выпуклой оптимизации
ЮЕ Нестеров · 2010
Cited alongside, same era.
Composite objective mirror descent
John C Duchi, Shai Shalev-Shwartz, Yoram Singer, and Ambuj Tewari · 2010
Cited alongside, same era.
An optimal method for stochastic composite optimization
Guanghui Lan · 2012
Cited alongside, same era.
Validation analysis of mirror descent stochastic approximation method
Guanghui Lan, Arkadi Nemirovski, and Alexander Shapiro · 2012
Cited alongside, same era.

Exactness, inexactness and stochasticity in first-order methods for large-scale convex optimization
Olivier Devolder · 2013
Later among the works it cites.
Accelerated, parallel, and proximal coordinate descent
Olivier Fercoq and Peter Richtárik · 2015
Later among the works it cites.
Universal fast gradient method for stochastic composit optimization problems
Original
Alexander Gasnikov and Yurii Nesterov · 2016
Later among the works it cites.
Identity matters in deep learning
Moritz Hardt and Tengyu Ma · 2017
Closest in time.