Distributed Optimization With Uncertain Communications
Pouya Rezaeinia, Bahman Gharesifard, Tamás Linder · IEEE Transactions on Automatic Control · 2024
In this article, we consider a distributed optimization problem for the sum of convex functions where the underlying communication network connecting nodes at each time epoch is drawn at random from a collection of directed graphs. We propose a modified version of the subgradient-push algorithm that provably almost surely converges to an optimizer on any such sequence of random directed graphs. We also prove that the convergence rate of our proposed algorithm is upper bounded as$ O(\frac{1}{\sqrt{t}})$, where$t$is the time horizon.