A unified mini-batch stochastic accelerated method for nonconvex stochastic programming

DOI10.1007/S00186-026-00916-8MaRDI QIDQ7228087zbMATH OpenFDO

Authors Ruyu Wang, Cong Liu, Quanwei Gao

Publication date 13 April 2026

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

zbMATH Keywords

complexitystochastic approximationaccelerated algorithmnonconvex stochastic programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Stochastic programming (90C15)

Cites work

• A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization
• A Stochastic Approximation Method
• A stochastic Nesterov's smoothing accelerated method for general nonsmooth constrained stochastic composite convex optimization
• Accelerated Stochastic Algorithms for Nonconvex Finite-Sum and Multiblock Optimization
• Accelerated gradient methods for nonconvex nonlinear and stochastic programming
• Accelerated stochastic Peaceman-Rachford method for empirical risk minimization
• Acceleration of Stochastic Approximation by Averaging
• An Accelerated Stochastic ADMM for Nonconvex and Nonsmooth Finite-Sum Optimization
• An inexact accelerated stochastic ADMM for separable convex optimization
• An optimal method for stochastic composite optimization
• Convergence on a symmetric accelerated stochastic ADMM with larger stepsizes
• First-order methods in optimization
• Generalized asymmetric forward-backward-adjoint algorithms for convex-concave saddle-point problem
• Generalized uniformly optimal methods for nonlinear programming
• Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
• Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework
• Randomized smoothing for stochastic optimization
• Robust Stochastic Approximation Approach to Stochastic Programming
• Smoothed Variable Sample-Size Accelerated Proximal Methods for Nonsmooth Stochastic Convex Programs
• Smoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems
• Technical note -- On the convergence rate of stochastic approximation for gradient-based stochastic optimization
• Universal gradient methods for convex optimization problems

This page was built for publication: A unified mini-batch stochastic accelerated method for nonconvex stochastic programming

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