Fixed Point Optimization Algorithms for Network Bandwidth Allocation Problems with Compoundable Constraints

被引：15
|
作者：
Iiduka, Hideaki [1 ]
Uchida, Masato [1 ]
机构：
[1] Network Design Res Ctr, Kyushu Inst Technol, Tokyo 1000011, Japan
来源：
IEEE COMMUNICATIONS LETTERS | 2011年 / 15卷 / 06期
基金：
日本学术振兴会;
关键词：
Nonexpansive mapping; network bandwidth allocation problem; non-concave utility maximization problem; fixed point optimization algorithm;
D O I：
10.1109/LCOMM.2011.040711.101369
中图分类号：
TN [电子技术、通信技术];
学科分类号：
0809 ;
摘要：
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.
引用
收藏
页码：596 / 598
页数：3
相关论文
共 50 条
12345