Shuffling momentum gradient algorithm for convex optimization

DOI10.1007/S10013-024-00699-7MaRDI QIDQ6913294zbMATH OpenFDO

Authors Trang H. Tran, Quoc Tran Dinh, Lam M. Nguyen

Publication date 21 October 2025

Published in Vietnam Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10013-024-00699-7

zbMATH Keywords

convergence ratesfinite-sum convex optimizationmomentum techniqueshuffling gradient method

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Convex programming (90C25)

Cites work

• A Stochastic Approximation Method
• Adaptive subgradient methods for online learning and stochastic optimization
• Convergence rate of incremental subgradient algorithms
• Foundations of machine learning
• scientific article; zbMATH DE number 7626722 (Why is no real title available?)
• Incremental subgradient methods for nondifferentiable optimization
• Introductory lectures on convex optimization. A basic course.
• On the influence of momentum acceleration on online learning
• Optimization methods for large-scale machine learning
• Parallel stochastic gradient algorithms for large-scale matrix completion
• Some methods of speeding up the convergence of iteration methods
• Why random reshuffling beats stochastic gradient descent

Cited in

(1)

• Adjusted shuffling SARAH: advancing complexity analysis via dynamic gradient weighting

This page was built for publication: Shuffling momentum gradient algorithm for convex optimization

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