.png){kind=icon}
.png){kind=icon}
Return
Distributed Optimization for Network Resource Allocation With Nonsmooth Utility Functions
.png){kind=icon}
PRE
AI
DOI：10.1109/TCNS.2018.2889011.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The network utility maximization problem is the problem of maximizing the overall utility of a network under capacity constraints, where each source in the network has its own private nonsmooth concave utility function (which allows the true utility to be modeled accurately) and each link in the network has only its capacity constraint. To solve this problem, two distributed optimization algorithms are proposed: a projected proximal algorithm and a projected subgradient algorithm. These algorithms can be implemented for the case that each source tries to maximize only its utility by using its proximity operator or subdifferential and each link tries to satisfy only its capacity constraint by using the metric projection onto its capacity constraint set. A convergence analysis indicates that these algorithms are sufficient for each source to find the optimal resource allocation. The convergence, optimality, and performance of the proposed algorithms are demonstrated through numerical comparisons with the existing decentralized network flow control algorithm.
Keywords:
Distributed optimization
metric projection
network utility maximization (NUM)
nonsmooth utility function
proximity operator
subdifferential
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5
Papers:
1.6K
Citations:
5.8K