A divide-and-conquer algorithm for distributed optimization on networks

In this paper, we consider networks with topologies described by some connected undirected graph G=(V,E) and with some agents (fusion centers) equipped with processing power and local peer-to-peer communication, and optimization problem minx⁡{F(x)=∑i∈Vfi(x)} with local objective functions fi dependi...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Applied and computational harmonic analysis Ročník 70; s. 101623
Hlavní autori:	Emirov, Nazar, Song, Guohui, Sun, Qiyu
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.05.2024
Predmet:	Distributed optimization Divide-and-conquer algorithm Graph signal processing Graph signal processing Distributed optimization Divide-and-conquer algorithm
ISSN:	1063-5203, 1096-603X
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!