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

Full description

Bibliographic Details

Published in:	Applied and computational harmonic analysis Vol. 70; p. 101623
Main Authors:	Emirov, Nazar, Song, Guohui, Sun, Qiyu
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.05.2024
Subjects:	Distributed optimization Divide-and-conquer algorithm Graph signal processing Graph signal processing Distributed optimization Divide-and-conquer algorithm
ISSN:	1063-5203, 1096-603X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!