Distributed averaging deals with a network of n> 1 agents and the constraint that each agent
is able to communicate only with its neighbors. The purpose of the distributed averaging …

The alternating direction multipliers method (ADMM) has been recently proposed as a
practical and efficient algorithm for distributed computing. We discuss its applicability to the …

Motivated by applications in multi-sensor array detection and estimation, this paper studies
the problem of tracking the principal eigenvector and the principal subspace of a signal's …

This paper explores the use of accelerated gradient methods in networked optimization.
Optimal algorithm parameters and associated convergence rates are derived for distributed …

Recently, gossip algorithms have received much attention from the wireless sensor network
community due to their simplicity, scalability and robustness. Motivated by applications such …

In the recent years a lot of effort has been devoted to the problem of finding distributed
algorithms that achieve a fast consensus. The distributed evaluation of polynomials …

This technical note develops Ideal Controlled Hopwise Averaging (ICHA) and Controlled
Hopwise Averaging (CHA), two asynchronous distributed averaging algorithms for wireless …

Global observation of the environment is a key component in sensor networks and multi-
robot systems. Distributed consensus algorithms make all the nodes in the network to …

We present an approach to gossip algorithms tailored to the practical considerations of
wireless communications. Traditional gossip algorithms operate via the pairwise exchange …

Randomized gossip algorithms are attractive for collaborative in-network processing and
aggregation because they are fully asynchronous, they require no overhead to establish and …