Distributed Resource Allocation via ADMM over Digraphs

W. Jiang, M. Doostmohammadian, T. Charalambous

Tutkimustuotos: Artikkeli kirjassa/konferenssijulkaisussaConference article in proceedingsScientificvertaisarvioitu

10 Sitaatiot (Scopus)
107 Lataukset (Pure)

Abstrakti

In this paper, we solve the resource allocation problem over a network of agents, with edges as communication links that can be unidirectional. The goal is to minimize the sum of allocation cost functions subject to a coupling constraint in a distributed way by using the finite-time consensus-based alternating direction method of multipliers (ADMM) technique. In contrast to the existing gradient descent (GD) based distributed algorithms, our approach can be applied to non-differentiable cost functions. Also, the proposed algorithm is initialization-free and converges at a rate of $\mathcal{O}\left( {1/k} \right)$, where k is the optimization iteration counter. The fast convergence performance related to iteration counter k compared to state-of-the-art GD based algorithms is shown via a simulation example.
AlkuperäiskieliEnglanti
Otsikko2022 IEEE 61st Conference on Decision and Control (CDC)
KustantajaIEEE
Sivut5645-5651
Sivumäärä7
ISBN (elektroninen)978-1-6654-6761-2
DOI - pysyväislinkit
TilaJulkaistu - 10 tammik. 2023
OKM-julkaisutyyppiA4 Artikkeli konferenssijulkaisussa
TapahtumaIEEE Conference on Decision and Control - Cancun, Mexico, Cancun, Meksiko
Kesto: 6 jouluk. 20229 jouluk. 2022
Konferenssinumero: 61

Julkaisusarja

NimiProceedings of the IEEE Conference on Decision & Control
ISSN (elektroninen)2576-2370

Conference

ConferenceIEEE Conference on Decision and Control
LyhennettäCDC
Maa/AlueMeksiko
KaupunkiCancun
Ajanjakso06/12/202209/12/2022

Sormenjälki

Sukella tutkimusaiheisiin 'Distributed Resource Allocation via ADMM over Digraphs'. Ne muodostavat yhdessä ainutlaatuisen sormenjäljen.

Siteeraa tätä