.png){kind=icon}
.png){kind=icon}
Return
An Adaptive Continuous-Time Algorithm for Nonsmooth Convex Resource Allocation Optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2021.3137054.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article develops a novel continuous-time algorithm based on the idea of adaptive strategy for solving a resource allocation optimization with nonsmooth objective functions and constraints over multiagent network. It is proved that the state solution is globally bounded and finally converges to an optimal solution to the nonsmooth convex resource allocation problem. Compared with the existing algorithms, the strong/strict convexity of the objective function is relaxed and only convexity is required. Moreover, by employing an exact penalty approach for the distributed optimization, the primal-dual variables is avoided to introduce. Therefore, the proposed algorithm has a simple structure with low dimensionality of state variables. To show the effectiveness and practicability of the presented algorithm, a numerical example and an application in power system are presented.
Keywords:
Optimization
Resource management
Complexity theory
Aerospace electronics
Technological innovation
Linear programming
Laplace equations
Continuous-time algorithm
multiagent network
resource allocation optimization
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W