Online distributed optimization algorithm with dynamic regret analysis under unbalanced graphs

DOI10.1016/J.AUTOMATICA.2025.112116MaRDI QIDQ6930009zbMATH OpenFDO

Authors Songquan Yao, Siyu Xie, Tao Li

Publication date 16 September 2025

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AUTOMATICA.2025.112116

zbMATH Keywords

convex optimizationdistributed optimizationdynamic regretonline learningonline push-pull algorithm

Mathematics Subject Classification ID

Applications of graph theory (05C90) Learning and adaptive systems in artificial intelligence (68T05) Communication networks in operations research (90B18) Convex programming (90C25)

Cites work

• Centralized and Distributed Online Learning for Sparse Time-Varying Optimization
• Distributed Convex Optimization with Inequality Constraints over Time-Varying Unbalanced Digraphs
• Distributed Online Convex Optimization on Time-Varying Directed Graphs
• Distributed Online Convex Optimization With Time-Varying Coupled Inequality Constraints
• Distributed Online Optimization in Dynamic Environments Using Mirror Descent
• Logarithmic regret algorithms for online convex optimization
• Push–Pull Gradient Methods for Distributed Optimization in Networks
• Quantized Distributed Gradient Tracking Algorithm With Linear Convergence in Directed Networks

Cited in

(1)

• Distributed online sparse identification for multivariate stochastic regression models

This page was built for publication: Online distributed optimization algorithm with dynamic regret analysis under unbalanced graphs

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