General inertial proximal stochastic mirror descent algorithm beyond Lipschitz smoothness assumption

Abstract

In this paper, minimizing the sum of an average of finite proper closed nonconvex functions and a proper lower semicontinuous convex function over a closed convex set, is considered. We propose the general inertial proximal stochastic mirror descent (IPSMD for short) algorithm framework, which not only introduces the more general inertial technique and the variance reduced gradient estimator, but also circumvents the restrictive condition of Lipschitz smoothness by using Legendre function. In theory, we establish that the sequence generated by IPSMD algorithm globally converges to the critical point, under the condition that the objective function is semialgebraic. Besides the theoretical improvement in the convergence analysis, there are also possible computational advantages which provide an interesting option for practical problems.