mlsanityData to 14 Oct 2026

Online Distributed Optimization on Dynamic Networks

arXiv 1412.7215 ↗First posted 22 Dec 2014math.OC cs.DS cs.LGcited by 15

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

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 2; 2022: 4; 2023: 4; 2024: 2; 2025: 1; 2026: 2.

15 papers.

Sort: