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äiskieli | Englanti |
---|---|
Otsikko | 2022 IEEE 61st Conference on Decision and Control (CDC) |
Kustantaja | IEEE |
Sivut | 5645-5651 |
Sivumäärä | 7 |
ISBN (elektroninen) | 978-1-6654-6761-2 |
DOI - pysyväislinkit | |
Tila | Julkaistu - 10 tammik. 2023 |
OKM-julkaisutyyppi | A4 Artikkeli konferenssijulkaisussa |
Tapahtuma | IEEE Conference on Decision and Control - Cancun, Mexico, Cancun, Meksiko Kesto: 6 jouluk. 2022 → 9 jouluk. 2022 Konferenssinumero: 61 |
Julkaisusarja
Nimi | Proceedings of the IEEE Conference on Decision & Control |
---|---|
ISSN (elektroninen) | 2576-2370 |
Conference
Conference | IEEE Conference on Decision and Control |
---|---|
Lyhennettä | CDC |
Maa/Alue | Meksiko |
Kaupunki | Cancun |
Ajanjakso | 06/12/2022 → 09/12/2022 |