Adaptive Stochastic Mirror Descent for Constrained Optimization
classification
🧮 math.OC
keywords
adaptivedescentmirroroptimizationstepsizesstochasticanalyzesaverage
read the original abstract
Mirror Descent (MD) is a well-known method of solving non-smooth convex optimization problems. This paper analyzes the stochastic variant of MD with adaptive stepsizes. Its convergence on average is shown to be faster than with the fixed stepsizes and optimal in terms of lower bounds.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.