Dual averaging algorithm with memory mechanism for nonsmooth optimization problems

DOI10.1016/J.CNSNS.2026.110573MaRDI QIDQ7314519zbMATH OpenFDO

Authors Yan Tang, Jin-Ming Wang

Publication date 14 August 2026

Published in Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.CNSNS.2026.110573

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27) Convex programming (90C25)

Cites work

• Adaptive subgradient methods for online learning and stochastic optimization
• Convergence analysis of the Halpern iteration with adaptive anchoring parameters
• Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
• Dual averaging methods for regularized stochastic learning and online optimization
• scientific article; zbMATH DE number 3850830 (Why is no real title available?)
• scientific article; zbMATH DE number 3282977 (Why is no real title available?)
• scientific article; zbMATH DE number 3341597 (Why is no real title available?)
• Logarithmic regret algorithms for online convex optimization
• On the adaptivity of stochastic gradient-based optimization
• Primal-dual subgradient methods for convex problems
• Scaled, inexact, and adaptive generalized FISTA for strongly convex optimization
• Smooth minimization of non-smooth functions
• Unifying mirror descent and dual averaging
• Universal gradient methods for convex optimization problems

This page was built for publication: Dual averaging algorithm with memory mechanism for nonsmooth optimization problems

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