.png){kind=icon}
.png){kind=icon}
Return
A novel method for distributed optimization with globally coupled constraints based on multi-agent systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2021.11.014.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A continuous-time distributed algorithm based on multi-agent systems is proposed to solve the convex nonsmooth optimization with globally coupled constraints in this paper. Firstly, the relationship of equivalence between the equilibrium and the optimal solution of the system is proved by using the properties of projection operator and saddle point. In addition, the stability of the algorithm is analyzed by means of Lie derivative and set-valued LaSalle's invariance principle. In particular, the trajectory of the proposed algorithm from any initial point can converge to the global optimal solution. Finally, the effectiveness of the designed algorithm is verified by numerical simulations.(c) 2021 Elsevier B.V. All rights reserved.
Keywords:
Distributed optimization
Multi-agent systems
Coupled constraints
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W