AsySPA: An Exact Asynchronous Algorithm for Convex Optimization Over Digraphs

This paper proposes a novel exact asynchronous subgradient-push algorithm (AsySPA) to solve an additive cost optimization problem over digraphs where each node only has access to a local convex function and updates asynchronously with an arbitrary rate. Specifically, each node of a strongly connecte...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on automatic control Jg. 65; H. 6; S. 2494 - 2509
Hauptverfasser:	Zhang, Jiaqi, You, Keyou
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.06.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Asynchronous subgradient-push algorithm (AsySPA) Clocks Computational geometry Computer simulation Convergence Convex functions Convexity Delays Distributed algorithms distributed optimization problem (DOP) even update rates (EUR) Graph theory Nodes Optimization Synchronization uneven update rates (UUR)
ISSN:	0018-9286, 1558-2523
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!