Journal article
Asynchronous ADMM via a data exchange server
- Abstract:
- With advances in inter-processing-unit communication technology, distributed algorithms are becoming increasingly advantageous. This paper focuses on solving convex distributed optimisation problems with local consensus coupling constraints via the alternating direction method of multipliers (ADMM), by means of an asynchronous methodology allowing for communication delays. We use a bipartite undirected graph to denote the update structure of the processing agents that cooperatively perform the distributed algorithm without a centralised aggregator. We introduce a data server to exchange the asynchronous consensus data among the processing agents. Under certain technical assumptions that involve bounded delays, bounded step sizes, and strong convexities in parts of the local objectives, the running average of the local iterates generated by the proposed asynchronous algorithm converge to an optimal solution.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, pdf, 1.1MB, Terms of use)
-
- Publisher copy:
- 10.1109/TCNS.2024.3354840
Authors
- Publisher:
- IEEE
- Journal:
- IEEE Transactions on Control of Network Systems More from this journal
- Volume:
- 11
- Issue:
- 3
- Article number:
- 1631 - 1643
- Publication date:
- 2024-01-16
- Acceptance date:
- 2024-01-06
- DOI:
- EISSN:
-
2325-5870
- Language:
-
English
- Keywords:
- Pubs id:
-
1595518
- Local pid:
-
pubs:1595518
- Deposit date:
-
2024-01-06
Terms of use
- Copyright holder:
- IEEE
- Copyright date:
- 2024
- Rights statement:
- © IEEE 2024
- Notes:
- This is the accepted manuscript version of the article. The final version is available online from IEEE at: https://dx.doi.org/10.1109/TCNS.2024.3354840
If you are the owner of this record, you can report an update to it here: Report update to this record