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

Celý popis

Podrobná bibliografia

Vydané v:	Expositiones mathematicae Ročník 43; číslo 6; s. 125740
Hlavní autori:	Emirov, Nazar, Song, Guohui, Sun, Qiyu
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier GmbH 01.12.2025
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!