Distributed Adaptive Algorithm for Resource Allocation Problem Over Weight-Unbalanced Graphs
- Publisher:
- Institute of Electrical and Electronics Engineers (IEEE)
- Publication Type:
- Journal Article
- Citation:
- IEEE Transactions on Network Science and Engineering, 2023, PP, (99), pp. 1-10
- Issue Date:
- 2023-01-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| 63Distributed Adaptive Algorithm for Resource Allocation Problem Over Weight-Unbalanced Graphs.pdf | Published version | 1.35 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
The paper presents the theoretical results on the resource allocation problems with local feasible convex set constraints under strongly connected graphs, where the objective function is non-smooth. It is worth noting that the communication graphs are general and include the weight-unbalanced directed graphs. Based on projection method, a distributed continuous-time adaptive algorithm is designed to achieve the optimal allocation. Moreover, the finite-time projection scheme is adopted to estimate a positive right-eigenvector of the out-Laplacian matrix from any initial value, which is a good indication for the robustness of the distributed algorithm when the communication topology is attacked and changed at some point. By convex and non-smooth analysis, we proved that the output variable asymptotically converges to the optimal allocation. Besides, the exponential convergence of the algorithm is analyzed without considering the local convex constraints. Finally, two illustrative examples are performed to substantiate the theoretical results under weight-unbalanced communication graphs.
Please use this identifier to cite or link to this item: