Asynchronous distributed optimization using a randomized alternating direction method of multipliers

Consider a set of networked agents endowed with private cost functions and seeking to find a consensus on the minimizer of the aggregate cost. A new class of random asynchronous distributed optimization methods is introduced. The methods generalize the standard Alternating Direction Method of Multip...

Full description

Saved in:
Bibliographic Details
Published in52nd IEEE Conference on Decision and Control pp. 3671 - 3676
Main Authors Iutzeler, Franck, Bianchi, Pascal, Ciblat, Philippe, Hachem, Walid
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2013
Subjects
Convergence
Convex functions
Equations
Optimization
Random variables
Vectors
Online AccessGet full text
ISBN1467357146
9781467357142
ISSN0191-2216
DOI10.1109/CDC.2013.6760448

Cover

More Information
Summary:Consider a set of networked agents endowed with private cost functions and seeking to find a consensus on the minimizer of the aggregate cost. A new class of random asynchronous distributed optimization methods is introduced. The methods generalize the standard Alternating Direction Method of Multipliers (ADMM) to an asynchronous setting where isolated components of the network are activated in an uncoordinated fashion. The algorithms rely on the introduction of randomized Gauss-Seidel iterations of Douglas-Rachford splitting leading to an asynchronous algorithm based on the ADMM. Convergence to the sought minimizers is provided under mild connectivity conditions.
ISBN:1467357146
9781467357142
ISSN:0191-2216
DOI:10.1109/CDC.2013.6760448