.png){kind=icon}
Return
D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/TSP.2013.2254478.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a distributed algorithm, named Distributed Alternating Direction Method of Multipliers (D-ADMM), for solving separable optimization problems in networks of interconnected nodes or agents. In a separable optimization problem there is a private cost function and a private constraint set at each node. The goal is to minimize the sum of all the cost functions, constraining the solution to be in the intersection of all the constraint sets. D-ADMM is proven to converge when the network is bipartite or when all the functions are strongly convex, although in practice, convergence is observed even when these conditions are not met. We use D-ADMM to solve the following problems from signal processing and control: average consensus, compressed sensing, and support vector machines. Our simulations show that D-ADMM requires less communications than state-of-the-art algorithms to achieve a given accuracy level. Algorithms with low communication requirements are important, for example, in sensor networks, where sensors are typically battery-operated and communicating is the most energy consuming operation.
Keywords:
Alternating direction method of multipliers
distributed algorithms
sensor networks
Journal
IF:
13.7
Papers:
1.0W
Citations:
8.4W
Organization
Cited Papers
ShareSaveImpaired B Cell Development and Proliferation in Absence of Phosphoinositide 3-Kinase p85α.png)
Science
ScienceIF0
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSave
View more