@Article{NMTMA-16-914,
author = {Xiao , Tiannan and Yang , Guoguo},
title = {A Convergence Study of SGD-Type Methods for Stochastic Optimization},
journal = {Numerical Mathematics: Theory, Methods and Applications},
year = {2023},
volume = {16},
number = {4},
pages = {914--930},
abstract = {<p style="text-align: justify;">In this paper, we first reinvestigate the convergence of the vanilla SGD
method in the sense of $L^2$ under more general learning rates conditions and a more
general convex assumption, which relieves the conditions on learning rates and does
not need the problem to be strongly convex. Then, by taking advantage of the Lyapunov function technique, we present the convergence of the momentum SGD and
Nesterov accelerated SGD methods for the convex and non-convex problem under $L$-smooth assumption that extends the bounded gradient limitation to a certain extent.
The convergence of time averaged SGD was also analyzed.</p>},
issn = {2079-7338},
doi = {https://doi.org/10.4208/nmtma.OA-2022-0179},
url = {http://global-sci.org/intro/article_detail/nmtma/22116.html}
}