A Distributed Algorithm for Nonsmooth Resource Allocation Problems with Directed Networks

This paper studies a nonsmooth convex resource allocation problem subjects to local inequality constrains and global equality constraints. A distributed continuous-time algorithm is designed to solve the problem where each agent only knows the local non-smooth objective function and linear or nonlin...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Chinese Control and Decision Conference s. 1722 - 1727
Hlavní autoři: Duan, Yuzhu, Hu, Jiangping
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 20.05.2023
Témata:
Convergence
Distributed algorithms
Distributed continuous-time algorithm
Linear programming
nonsmooth function
power systems
Process control
resource allocation
Resource management
Simulation
ISSN:1948-9447
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 studies a nonsmooth convex resource allocation problem subjects to local inequality constrains and global equality constraints. A distributed continuous-time algorithm is designed to solve the problem where each agent only knows the local non-smooth objective function and linear or nonlinear local constraints over a weight-balanced directed network. Through nonsmooth analysis and set-valued LaSalle invariance principle, the global convergence to the optimal solution is analyzed. Meanwhile, the distributed algorithm can converge to the optimal solution from any initial condition. To demonstrate the effectiveness of the proposed distributed algorithm, a numerical example is presented to demonstrate the effectiveness of the distributed algorithm.
ISSN:1948-9447
DOI:10.1109/CCDC58219.2023.10327111