Online Distributed Optimization on Dynamic Networks
Not on the map. Why?
Abstract (arXiv)
This paper presents a distributed optimization scheme over a network of agents in the presence of cost uncertainties and over switching communication topologies. Inspired by recent advances in distributed convex optimization, we propose a distributed algorithm based on a dual sub-gradient averaging. The objective of this algorithm is to minimize a cost function cooperatively. Furthermore, the algorithm changes the weights on the communication links in the network to adapt to varying reliability of neighboring agents. A convergence rate analysis as a function of the underlying network topology is then presented, followed by simulation results for representative classes of sensor networks.
Key facts. Cited by 15 papers in the map (data through 14 Oct 2026). First posted on arXiv 22 Dec 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 4; 2023: 4; 2024: 2; 2025: 1; 2026: 2.
15 papers.
Sort:
- 2021Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimizationcited by 21
- 2021One More Step Towards Reality: Cooperative Bandits with Imperfect Communicationcited by 15
- 2023Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater's Conditioncited by 14
- 2023Byzantine-Robust Distributed Online Learning: Taming Adversarial Participants in An Adversarial Environmentcited by 8
- 2022Dynamic Regret of Adaptive Gradient Methods for Strongly Convex Problemscited by 4
- 2023Dynamic Regret Analysis of Safe Distributed Online Optimization for Convex and Non-convex Problemscited by 4
- 2025Decentralized Online Riemannian Optimization Beyond Hadamard Manifoldscited by 4
- 2024Distributed Online Optimization with Stochastic Agent Availabilitycited by 3
- 2022Distributed Online Non-convex Optimization with Composite Regretcited by 2
- 2026Decentralized Online Convex Optimization with Unknown Feedback Delayscited by 2
- 2022A Survey on Distributed Online Optimization and Gamecited by 1
- 2023Learning-Augmented Decentralized Online Convex Optimization in Networkscited by 1
- 2026Decentralized Online Riemannian Optimization for Strongly Geodesically Convex Functions22 Jul 2026
- 2026Decentralized Online Convex Optimization with Unknown Feedback Delays12 Jan 2026
- 2025Decentralized Online Riemannian Optimization Beyond Hadamard Manifolds9 Sep 2025
- 2024Distributed Online Optimization with Stochastic Agent Availability25 Nov 2024
- 2024Online design of dynamic networks11 Oct 2024
- 2023Byzantine-Robust Distributed Online Learning: Taming Adversarial Participants in An Adversarial Environment16 Jul 2023
- 2023Learning-Augmented Decentralized Online Convex Optimization in Networks16 Jun 2023
- 2023Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater's Condition31 May 2023
- 2023Dynamic Regret Analysis of Safe Distributed Online Optimization for Convex and Non-convex Problems23 Feb 2023
- 2022Distributed Online Non-convex Optimization with Composite Regret21 Sep 2022
- 2022Finite Sample Guarantees for Distributed Online Parameter Estimation with Communication Costs12 Sep 2022
- 2022Dynamic Regret of Adaptive Gradient Methods for Strongly Convex Problems4 Sep 2022
- 2021Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimizationcited by 21
- 2021One More Step Towards Reality: Cooperative Bandits with Imperfect Communicationcited by 15
- 2023Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater's Conditioncited by 14
- 2023Byzantine-Robust Distributed Online Learning: Taming Adversarial Participants in An Adversarial Environmentcited by 8
- 2022Dynamic Regret of Adaptive Gradient Methods for Strongly Convex Problemscited by 4
- 2023Dynamic Regret Analysis of Safe Distributed Online Optimization for Convex and Non-convex Problemscited by 4
- 2025Decentralized Online Riemannian Optimization Beyond Hadamard Manifoldscited by 4
- 2024Distributed Online Optimization with Stochastic Agent Availabilitycited by 3
- 2022Distributed Online Non-convex Optimization with Composite Regretcited by 2
- 2026Decentralized Online Convex Optimization with Unknown Feedback Delayscited by 2
- 2022A Survey on Distributed Online Optimization and Gamecited by 1
- 2023Learning-Augmented Decentralized Online Convex Optimization in Networkscited by 1
12 most cited of 15 All 15 (JSON)
- 2026Decentralized Online Riemannian Optimization for Strongly Geodesically Convex Functions22 Jul 2026
- 2026Decentralized Online Convex Optimization with Unknown Feedback Delays12 Jan 2026
- 2025Decentralized Online Riemannian Optimization Beyond Hadamard Manifolds9 Sep 2025
- 2024Distributed Online Optimization with Stochastic Agent Availability25 Nov 2024
- 2024Online design of dynamic networks11 Oct 2024
- 2023Byzantine-Robust Distributed Online Learning: Taming Adversarial Participants in An Adversarial Environment16 Jul 2023
- 2023Learning-Augmented Decentralized Online Convex Optimization in Networks16 Jun 2023
- 2023Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater's Condition31 May 2023
- 2023Dynamic Regret Analysis of Safe Distributed Online Optimization for Convex and Non-convex Problems23 Feb 2023
- 2022Distributed Online Non-convex Optimization with Composite Regret21 Sep 2022
- 2022Finite Sample Guarantees for Distributed Online Parameter Estimation with Communication Costs12 Sep 2022
- 2022Dynamic Regret of Adaptive Gradient Methods for Strongly Convex Problems4 Sep 2022
12 newest of 15 All 15 (JSON)