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...
Saved in:
| Published in: | Expositiones mathematicae Vol. 43; no. 6; p. 125740 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier GmbH
01.12.2025
|
| Subjects: | |
| ISSN: | 0723-0869 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!