Now showing items 1-2 of 2
Distributed subgradient method under random communication topology - the e
In this note we study the performance metrics (rate of convergence and guaranteed region of convergence) of a multi-agent subgradient method for optimizing a sum of convex functions. We assume that the agents exchange ...
Convergence results for the linear consensus problem under Markovian random graphs
This note discusses the linear discrete and continuous time consensus problem for a network of dynamic agents with directed information flows and random switching topologies. The switching is determined by a Markov chain, ...