Newton-Raphson Consensus for Distributed Convex Optimization

We address the problem of distributed unconstrained convex optimization under separability assumptions, i.e., the framework where each agent of a network is endowed with a local private multidimensional convex cost, is subject to communication constraints, and wants to collaborate to compute the min...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on automatic control Jg. 61; H. 4; S. 994 - 1009
Hauptverfasser: Varagnolo, Damiano, Zanella, Filippo, Cenedese, Angelo, Pillonetto, Gianluigi, Schenato, Luca
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.04.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithm design and analysis
Computational geometry
consensus
Control Engineering
Convergence
Convex functions
Convexity
Cost engineering
Cost function
Distributed optimization
Heuristic algorithms
Lyapunov methods
Mathematical models
multi-agent systems
Newton Raphson methods
Optimization
Reglerteknik
smooth functions
Strategy
unconstrained convex optimization
smooth functions
unconstrained convex optimization
multi-agent systems
distributed optimization
Newton-Raphson methods
Consensus
ISSN:0018-9286, 1558-2523, 1558-2523
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We address the problem of distributed unconstrained convex optimization under separability assumptions, i.e., the framework where each agent of a network is endowed with a local private multidimensional convex cost, is subject to communication constraints, and wants to collaborate to compute the minimizer of the sum of the local costs. We propose a design methodology that combines average consensus algorithms and separation of time-scales ideas. This strategy is proved, under suitable hypotheses, to be globally convergent to the true minimizer. Intuitively, the procedure lets the agents distributedly compute and sequentially update an approximated Newton-Raphson direction by means of suitable average consensus ratios. We show with numerical simulations that the speed of convergence of this strategy is comparable with alternative optimization strategies such as the Alternating Direction Method of Multipliers. Finally, we propose some alternative strategies which trade-off communication and computational requirements with convergence speed.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0018-9286
1558-2523
1558-2523
DOI:10.1109/TAC.2015.2449811