This paper considers stochastic subgradient mirror-descent method for solving constrained convex minimization problems. In particular, a stochastic subgradient mirror-descent method with weighted iterate-averaging is investigated and its per-iterate convergence rate is analyzed. The novel part of the approach is in the choice of weights that are used to construct the averages. Through the use of these weighted averages, we show that the known optimal rates can be obtained with simpler algorithms than those currently existing in the literature. Specifically, by suitably choosing the stepsize values, one can obtain the rate of the order 1/k for strongly convex functions, and the rate 1/ √ k for general convex functions (not necessarily differentiable). Furthermore, for the latter case, it is shown that a stochastic subgradient mirror-descent with iterate averaging converges (along a subsequence) to an optimal solution, almost surely, even with the stepsize of the form 1/ √ 1 + k, which was not previously known. The stepsize choices that achieve the best rates are those proposed by Paul Tseng for acceleration of proximal gradient methods [25] .
Nedić and Lee REF used a similar form of this scheme for a more general projected stochastic subgradient method using Bregman distances, which achieves 1/k convergence rate for strongly convex functions, and 1/ √ k convergence rate for general convex functions.
On Stochastic Subgradient Mirror-Descent Algorithm with Weighted Averaging
ArXiv
ArXiv
Computer Science Mathematics