Distributed Event-Triggered Algorithm Designs for Resource Allocation Problems via a Universal Scalar Function-Based Analysis

In this article, we are concerned with distributed algorithm designs for resource allocation problems via event-triggered communication. The target is to search an optimal resource allocation scheme such that the summation of <inline-formula> <tex-math notation="LaTeX">n(>&l...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on cybernetics Ročník 54; číslo 4; s. 1 - 11
Hlavní autoři: Li, Ranran, Yang, Guang-Hong
Médium: Journal Article
Jazyk:angličtina
Vydáno: United States IEEE 01.04.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Communication
Convergence
Distributed algorithms
Distributed optimization
event-triggered communication
Linear programming
Mathematical analysis
Matrix decomposition
Optimization
Privacy
Resource allocation
Resource management
scalar function
ISSN:2168-2267, 2168-2275, 2168-2275
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this article, we are concerned with distributed algorithm designs for resource allocation problems via event-triggered communication. The target is to search an optimal resource allocation scheme such that the summation of <inline-formula> <tex-math notation="LaTeX">n(></tex-math> </inline-formula>1) objective functions is minimized. Due to communication efficiency and privacy concerns, distributed algorithms with event-triggered communications are proposed in this article. The communication is only permitted or triggered if variation of gradient of the local objective function exceeds a threshold. By constructing a novel technical lemma and a universal scalar function, the convergence and linear convergence rates are established under some mild assumptions. Extensive numerical experiments on the IEEE 118-bus power system demonstrate that: Compared to the periodic algorithms, such as ADMM and Mirror-P-EXTRA, the proposed algorithms not only remarkably reduce the communication times but also have competitive convergence speed. The latter is striking that it implies there exist useless communications in the periodic algorithms that are censored by the proposed event-triggered strategy.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:2168-2267
2168-2275
2168-2275
DOI:10.1109/TCYB.2022.3219449