.png){kind=icon}
.png){kind=icon}
Return
Fixed Point Optimization Algorithms for Network Bandwidth Allocation Problems with Compoundable Constraints
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2011.040711.101369.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, we develop a novel computational approach for network bandwidth allocation problems in which the compoundable constraints about the preferable transmission rate fall in the infeasible region. The approach is based on an iterative technique for non-convex optimization over the fixed point set of a certain nonexpansive mapping. The realized allocation maximizes a predefined utility and is closest to the preferable transmission rate with respect to the norm. Numerical examples show that our approach is an efficient way to solve the non-concave utility maximization problem.
Keywords:
Nonexpansive mapping
network bandwidth allocation problem
non-concave utility maximization problem
fixed point optimization algorithm
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W