An optimal algorithm for stochastic strongly-convex optimization
classification
🧮 math.OC
keywords
algorithmconvexoptimaloptimizationstochasticconsiderconvergencegive
read the original abstract
We consider stochastic convex optimization with a strongly convex (but not necessarily smooth) objective. We give an algorithm which performs only gradient updates with optimal rate of convergence.
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.