A Distributed Convex Optimization Algorithm over Directed Networks with Time Delay

This paper aims to explore a novel distributed convex optimization algorithm over directed networks with communication delay based on zero-gradient-sum strategy to solve a class of the distributed convex optimization problem. Firstly, distributed convex optimization problem is formulated as minimizi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Chinese Control Conference s. 5393 - 5398
Hlavní autoři: Wei, Yutian, Xie, Jin, Gao, Weifeng, Li, Hong
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: Technical Committee on Control Theory, Chinese Association of Automation 28.07.2024
Témata:
Convex functions
Delay effects
Delays
Directed Topology
Distributed Convex Optimization
Multi-agent System
Network topology
Numerical simulation
Sufficient conditions
Time Delay
Upper bound
Zero-Gradient-Sum
ISSN:1934-1768
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 paper aims to explore a novel distributed convex optimization algorithm over directed networks with communication delay based on zero-gradient-sum strategy to solve a class of the distributed convex optimization problem. Firstly, distributed convex optimization problem is formulated as minimizing a separable global objective function. Secondly, the convergence of improved algorithm is analyzed by constructing a Lyapunov-Krasovskii functional. In addition, a time delay upper bound is derived to make sure that all agents cooperatively converge to the global optimal consistency as a sufficient condition. Finally, a numerical simulation example is given to verify the effectiveness of improved algorithm.
ISSN:1934-1768
DOI:10.23919/CCC63176.2024.10662519