Performance Evaluation of the Consensus-based Distributed Subgradient Method Under Random Communication Topologies

Performance Evaluation of the Consensus-based Distributed Subgradient Method Under Random Communication Topologies

Title : Performance Evaluation of the Consensus-based Distributed Subgradient Method Under Random Communication Topologies
Authors :
Matei, Ion
Baras, John, S.
Conference : IEEE Journal of Selected topics in Signal Processing Volume 5., No. 4, pp. 754-771
Date: August 01 - August 01, 2011

We investigate the collaborative optimization of an objective function expressed as a sum of local convex functions, when the agents make decisions in a distributed manner using local information, while the communication topology used to exchange messages and information is modeled by a graph-valued random process, assumed independent and identically distributed. Specifically, we study the performance of the consensus-based multi-agent distributed subgradient method and show how it depends on the probability distribution of the random graph. For the case of a constant stepsize, we first give an upper bound on the difference between the objective function, evaluated at the agents’ estimates of the optimal decision vector, and the optimal value. Second, for a particular class of convex functions, we give an upper bound on the distances between the agents’ estimates of the optimal decision vector and the minimizer. In addition, we provide the rate of convergence to zero of the time varying component of the aforementioned upper bound. The addressed metrics are evaluated via their expected values. As an application, we show how the distributed optimization algorithm can be used to perform collaborative system identification and provide numerical experiments under the randomized and broadcast gossip protocols.

Download Full Paper