.png){kind=icon}
.png){kind=icon}
Return
Two-stage continuous-time triggered algorithms for constrained distributed optimization over directed graphs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jfranklin.2022.12.041.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes two-stage continuous-time triggered algorithms for solving distributed optimization problems with inequality constraints over directed graphs. The inequality constraints are penalized by adopting log-barrier penalty method. The first stage of the proposed algorithms is capable of finding the optimal point of each local optimization problem in finite time. In the second stage of the proposed algorithms, zero-gradient-sum algorithms with time-triggered and event-triggered communication strategies are considered in order to reduce communication costs. Then, with the help of LaSalle's invariance principle, it is proved that the state solution of each agent reaches consensus at the optimal point of the considered penalty distributed optimization problem, and Zeno behavior is also excluded. Finally, numerical examples are given to illustrate the effectiveness of the proposed algorithms. (c) 2023 The Franklin Institute. Published by Elsevier Inc. All rights reserved.
Keywords:
OPTIMAL RESOURCE-ALLOCATION
CONVEX-OPTIMIZATION
INITIALIZATION
COORDINATION
Journal
J
IF:
3.7
Papers:
6.4K
Citations:
1.5W