.png){kind=icon}
.png){kind=icon}
Return
Solving a class of resource allocation problem under dynamic constraints: A predefined-time distributed optimization scheme
.png){kind=icon}
PRE
AI
DOI：10.1016/j.isatra.2025.05.045.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• A predefined-time optimization algorithm is designed to solve the RAP in the distributed framework. • The algorithm designed in this paper can solve the RAP under dynamic constraints. • The distributed optimization algorithm designed in this paper can avoid the problem of privacy data leakage. • The convergence of the algorithm is analyzed strictly by the Lyapunov method. • The algorithm designed in this paper is an n-dimensional general framework, which can be applied to various scenarios.
Journal
IF:
6.5
Papers:
5.9K
Citations:
2.0W
Organization
No organization information available