Presentation 2010-11-18
Fixed Point Optimization Methods for Network Bandwidth Allocation Problems with Compoundable Constraints
Hideaki IIDUKA, Masato UCHIDA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we deal with network bandwidth allocation problems in which the capacity constraints and the compoundable constraints about the preferable transmission rate are infeasible, and develop a novel method for solving the problems. The method is based on an iterative algorithm for non-convex optimization over the fixed point set of a certain nonexpansive mapping. The realized allocation given by the proposed method is optimal in the sense that it maximizes a predefined utility and is closest to the preferable transmission rate with respect to the norm.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) nonexpansive mapping / generalized convex feasible set / network bandwidth allocation problem / non-concave utility maximization problem / fixed point optimization algorithm
Paper # CQ2010-48
Date of Issue

Conference Information
Committee CQ
Conference Date 2010/11/11(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Communication Quality (CQ)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Fixed Point Optimization Methods for Network Bandwidth Allocation Problems with Compoundable Constraints
Sub Title (in English)
Keyword(1) nonexpansive mapping
Keyword(2) generalized convex feasible set
Keyword(3) network bandwidth allocation problem
Keyword(4) non-concave utility maximization problem
Keyword(5) fixed point optimization algorithm
1st Author's Name Hideaki IIDUKA
1st Author's Affiliation Network Design Research Center, Kyushu Institute of Technology()
2nd Author's Name Masato UCHIDA
2nd Author's Affiliation Network Design Research Center, Kyushu Institute of Technology
Date 2010-11-18
Paper # CQ2010-48
Volume (vol) vol.110
Number (no) 287
Page pp.pp.-
#Pages 4
Date of Issue