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

Hideaki Iiduka, Masato Uchida

研究成果: Article査読

12 被引用数 (Scopus)

抄録

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.

本文言語English
論文番号5752800
ページ(範囲)596-598
ページ数3
ジャーナルIEEE Communications Letters
15
6
DOI
出版ステータスPublished - 2011 6 1
外部発表はい

ASJC Scopus subject areas

  • Modelling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering

フィンガープリント 「Fixed point optimization algorithms for network bandwidth allocation problems with compoundable constraints」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル