Unifying mirror descent and dual averaging
- 30 June 2022
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 199 (1-2) , 793-830
Abstract
No abstract availableKeywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Online Learning and Online Convex OptimizationFoundations and Trends in Machine Learning, 2012
- An optimal method for stochastic composite optimizationMathematical Programming, 2011
- Learning by mirror averagingThe Annals of Statistics, 2008
- Primal-dual subgradient methods for convex problemsMathematical Programming, 2007
- Dual extrapolation and its applications to solving variational inequalities and related problemsMathematical Programming, 2006
- Smooth minimization of non-smooth functionsMathematical Programming, 2004
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point ProblemsSIAM Journal on Optimization, 2004
- Mirror descent and nonlinear projected subgradient methods for convex optimizationOperations Research Letters, 2003
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman FunctionsSIAM Journal on Optimization, 1993
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programmingUSSR Computational Mathematics and Mathematical Physics, 1967