We study dual-based algorithms for distributed convex optimization problems over networks,
where the objective is to minimize a sum Σ i= 1 mfi (z) of functions over in a network. We …

We consider the standard model of distributed optimization of a sum of functions F (z)= Σ ni=
1 fi (z), where node i in a network holds the function fi (z). We allow for a harsh network …

This article proposes two average consensus algorithms exploiting the memory of agents.
The performance of the proposed as well as of several state-of-the-art consensus algorithms …

This paper considers the minimization of a sum of smooth and strongly convex functions
dispatched over the nodes of a communication network. Previous works on the subject …

The Fiedler vector of a graph is the eigenvector corresponding to the algebraic connectivity,
which is the second-smallest eigenvalue (counting multiple eigenvalues separately) of the …

In the last years, we could have witnessed significant progress in wireless sensor networks
in terms of many aspects such as hardware components, communication and routing …

As the mobility of the sensor nodes brings many advantages, mobile wireless sensor
networks have gained importance over the last years and find application in more areas …

This paper presents a family of discrete-time distributed algorithms that enable nodes in an
undirected, connected network to solve, in a fully decentralized fashion, a system of modular …