Now showing items 1-2 of 2
Push-sum Algorithm on Time-varying Random Graphs
In this thesis, we study the problem of achieving average consensus over a random time-varying sequence of directed graphs by extending the class of so-called push- sum algorithms to such random scenarios. Provided that ...
Distributed Online Optimization on time-varying networks
This thesis introduces two classes of discrete-time distributed online optimization algorithms, with a group of agents which communicate over a network. At each time, a private convex objective function is revealed to ...