---
abstract: 'We propose a distributed algorithm, named D-ADMM, for solving separable optimization problems in networks of interconnected nodes or agents. In a separable optimization problem, the cost function is the sum of all the agents’ private cost functions, and the constraint set is the intersection of all the agents’ private constraint sets. We require the private cost function and constraint set of a node to be known by that node only, during and before the execution of the algorithm. The application of our algorithm is illustrated with problems from signal processing and control, namely average consensus, compressed sensing, and support vector machines. It is well known that communicating in distributed environments is the most energy/time-demanding operation. Thus, algorithms using less communications are more prone to make networks live longer, e.g., sensor networks, or to execute faster, e.g., in supercomputing platforms. Through simulations for several network types and problems, we show that our algorithm requires less communications than the state-of-the-art algorithms.'
author:
- 'João F. C. Mota, João M. F. Xavier, Pedro M. Q. Aguiar, and Markus Püschel [^1]'
bibliography:
- 'paper.bib'
title: 'D-ADMM: A Communication-Efficient Distributed Algorithm For Separable Optimization'
---

Distributed algorithms, alternating direction method of multipliers, consensus, 