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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Applied and computational harmonic analysis Jg. 70; S. 101623
Hauptverfasser:	Emirov, Nazar, Song, Guohui, Sun, Qiyu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.05.2024
Schlagworte:	Distributed optimization Divide-and-conquer algorithm Graph signal processing Graph signal processing Distributed optimization Divide-and-conquer algorithm
ISSN:	1063-5203, 1096-603X
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!