.png){kind=icon}
Return
A fixed-time gradient algorithm for distributed optimization with inequality constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2023.02.022.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, a distributed fixed time gradient algorithm for neurodynamic systems is proposed for solv-ing optimization problems with local inequality constraints. The algorithm is designed using fixed time theory and sliding model control techniques, where each agent has a local objective function known only to itself, and the optimal solution of each local objective function sum can be obtained in a fixed time by the information interaction between neighbors under the condition of local inequality constraints. In addition, the upper bound of the fixed time can be obtained and it is proved theoretically that the upper bound of the fixed time is independent of the initial value. Finally, the stability and effectiveness of the algorithm are verified by numerical examples.(c) 2023 Elsevier B.V. All rights reserved.
Keywords:
Gradient algorithm
Fixed time convergence
Distributed optimization
Load sharing control
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
Cited Papers
Pheochromocytoma Crisis Caused by Contemporary Ergotamine, Caffeine, and Nimesulide Administration
PREAI
ShareSaveShareSaveAttitude tracking control for reentry vehicles using centralised robust model predictive control.png)
AUTOMATICA
OAAI
AUTOMATICAIF5.9
OAAIShareSaveA fixed-time convergent algorithm for distributed convex optimization in multi-agent systemsAUTOMATICA
AUTOMATICAIF5.9
PREAI
ShareSaveDistributed Finite-Time Optimal Resource Management for Microgrids Based on Multi-Agent FrameworkOAAI
OAAIShareSaveShareSave
View more