### 抄録

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 |

外部発表 | Yes |

### Fingerprint

### ASJC Scopus subject areas

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

### これを引用

*IEEE Communications Letters*,

*15*(6), 596-598. [5752800]. https://doi.org/10.1109/LCOMM.2011.040711.101369

**Fixed point optimization algorithms for network bandwidth allocation problems with compoundable constraints.** / Iiduka, Hideaki; Uchida, Masato.

研究成果: Article

*IEEE Communications Letters*, 巻. 15, 番号 6, 5752800, pp. 596-598. https://doi.org/10.1109/LCOMM.2011.040711.101369

}

TY - JOUR

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

AU - Iiduka, Hideaki

AU - Uchida, Masato

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 - fixed point optimization algorithm

KW - network bandwidth allocation problem

KW - non-concave utility maximization problem

KW - Nonexpansive mapping

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

VL - 15

SP - 596

EP - 598

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 6

M1 - 5752800

ER -