A framework of convergence analysis of mini-batch stochastic projected gradient methods

DOI10.1007/S40305-019-00276-7MaRDI QIDQ6097385zbMATH OpenOpenAlexFDO

Authors Jian Gu, Xiantao Xiao

Publication date 5 June 2023

Published in Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40305-019-00276-7

zbMATH Keywords

convergence analysisstochastic projected gradient methodvariance uniformly bounded

Mathematics Subject Classification ID

Stochastic approximation (62L20) Stochastic programming (90C15) Convex programming (90C25)

Recommendations

• A unified convergence analysis of stochastic Bregman proximal gradient and extragradient methods
• Projected semi-stochastic gradient descent method with mini-batch scheme under weak strong convexity assumption
• Convergence rates for the stochastic gradient descent method for non-convex objective functions
• Unified analysis of stochastic gradient methods for composite convex and smooth optimization
• Convergence of stochastic proximal gradient algorithm

Cites work

• A Stochastic Approximation Method
• Convex optimization: algorithms and complexity
• Extragradient Method with Variance Reduction for Stochastic Variational Inequalities
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• scientific article; zbMATH DE number 3534286 (Why is no real title available?)
• scientific article; zbMATH DE number 1972910 (Why is no real title available?)
• scientific article; zbMATH DE number 3449561 (Why is no real title available?)
• scientific article; zbMATH DE number 765034 (Why is no real title available?)
• Hybrid deterministic-stochastic methods for data fitting
• Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
• Minimizing finite sums with the stochastic average gradient
• On stochastic subgradient mirror-descent algorithm with weighted averaging
• Optimization methods for large-scale machine learning
• Robust Stochastic Approximation Approach to Stochastic Programming
• Sample size selection in optimization methods for machine learning
• Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
• Understanding machine learning. From theory to algorithms

Cited in

(1)

• Sign stochastic gradient descents without bounded gradient assumption for the finite sum minimization

This page was built for publication: A framework of convergence analysis of mini-batch stochastic projected gradient methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6097385)