Exponential convergence of a distributed divide-and-conquer algorithm for constrained convex optimization on networks

We propose a divide-and-conquer (DAC) algorithm for constrained convex optimization over networks, where the global objective is the sum of local objectives attached to individual agents. The algorithm is fully distributed: each iteration solves local subproblems around selected fusion centers and c...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Expositiones mathematicae Jg. 43; H. 6; S. 125740
Hauptverfasser:	Emirov, Nazar, Song, Guohui, Sun, Qiyu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier GmbH 01.12.2025
Schlagworte:	Constrained convex optimization on network Distributed and decentralized algorithm Divide and conquer algorithm secondary Constrained convex optimization on network Distributed and decentralized algorithm Divide and conquer algorithm primary
ISSN:	0723-0869
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!