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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on automatic control Ročník 65; číslo 6; s. 2494 - 2509
Hlavní autori:	Zhang, Jiaqi, You, Keyou
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.06.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!