Distributed Algorithm Over Time-Varying Unbalanced Graphs for Optimization Problem Subject to Multiple Local Constraints

This article addresses the optimization problem with its global objective function being composed of multiple convex functions under multiple nonidentical local constraints. The specific purpose is to resolve the studied optimization problem in a distributed manner in the presence of the time-varyin...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on control of network systems Ročník 12; číslo 1; s. 387 - 402
Hlavní autoři: Liu, Hongzhe, Yu, Wenwu, Wen, Guanghui, Zheng, Wei Xing
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway IEEE 01.03.2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Constraints
Control systems
Convergence
Directed graphs
Distributed algorithms
Distributed optimization algorithm
improved push–pull framework
Linear programming
multiple local constraints
Network systems
Numerical simulation
Optimization
time-varying unbalanced graphs
Vectors
ISSN:2325-5870, 2372-2533
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í:This article addresses the optimization problem with its global objective function being composed of multiple convex functions under multiple nonidentical local constraints. The specific purpose is to resolve the studied optimization problem in a distributed manner in the presence of the time-varying unbalanced graph sequence. For this purpose, an efficient distributed discrete-time algorithm is developed over the time-varying unbalanced graph sequence by improving the classical push-pull algorithms. Moreover, for the developed distributed discrete-time algorithm, a rigorous analysis is made of its convergence property to the optimal solution as well as its convergence rate under some standard assumptions. Finally, numerical simulations are carried out to demonstrate the good performance of the designed algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2325-5870
2372-2533
DOI:10.1109/TCNS.2024.3469048