TY - JOUR

T1 - Fixed point optimization algorithms for network bandwidth allocation problems with compoundable constraints

AU - Iiduka, Hideaki

AU - Uchida, Masato

N1 - Funding Information:
This work was supported in part by the Japan Society for the Promotion of Science through a Grant-in-Aid for Young Scientists (B) (21760062), and in part by the Japan Society for the Promotion of Science through a Grant-in-Aid for Scientific Research (S) (18100001).

PY - 2011/6

Y1 - 2011/6

N2 - 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.

AB - 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.

KW - Nonexpansive mapping

KW - fixed point optimization algorithm

KW - network bandwidth allocation problem

KW - non-concave utility maximization problem

UR - http://www.scopus.com/inward/record.url?scp=79959564616&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79959564616&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2011.040711.101369

DO - 10.1109/LCOMM.2011.040711.101369

M3 - Article

AN - SCOPUS:79959564616

SN - 1089-7798

VL - 15

SP - 596

EP - 598

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 6

M1 - 5752800

ER -