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 条

[41] Optimization in dynamic allocation of network bandwidth campus based on Xen
Sun Mingsong
Wang Yuefan
2014 9TH INTERNATIONAL FORUM ON STRATEGIC TECHNOLOGY (IFOST), 2014, : 83 - 86
[42] On modified proximal point algorithms for solving minimization problems and fixed point problems in CAT(κ) spaces
Pakkaranang, Nuttapol
Kumam, Poom
Wen, Ching-Feng
Yao, Jen-Chih
Cho, Yeol Je
MATHEMATICAL METHODS IN THE APPLIED SCIENCES, 2021, 44 (17) : 12369 - 12382
[43] Efficient primal-dual fixed point algorithms with dynamic stepsize for composite convex optimization problems
Wen, Meng
Tang, Yuchao
Cui, Angang
Peng, Jigen
MULTIDIMENSIONAL SYSTEMS AND SIGNAL PROCESSING, 2019, 30 (03) : 1531 - 1544
[44] On some accelerated optimization algorithms based on fixed point and linesearch techniques for convex minimization problems with applications
Pornsak Yatakoat
Suthep Suantai
Adisak Hanjing
Advances in Continuous and Discrete Models, 2022
[45] On some accelerated optimization algorithms based on fixed point and linesearch techniques for convex minimization problems with applications
Yatakoat, Pornsak
Suantai, Suthep
Hanjing, Adisak
ADVANCES IN CONTINUOUS AND DISCRETE MODELS, 2022, 2022 (1):
[46] Hybrid algorithms for equilibrium and common fixed point problems with applications
Qingnian Zhang
Huilian Wu
Journal of Inequalities and Applications, 2014
[47] ITERATIVE METHODS FOR PARALLEL CONVEX OPTIMIZATION WITH FIXED POINT CONSTRAINTS
Sakurai, Kaito
Jimba, Takayuki
Iiduka, Hideaki
JOURNAL OF NONLINEAR AND VARIATIONAL ANALYSIS, 2019, 3 (02): : 115 - 126
[48] Algorithms for split equality variational inequality and fixed point problems
Mekuriaw, Gedefaw
Zegeye, Habtu
Takele, Mollalgn Haile
Tufa, Abebe Regassa
APPLICABLE ANALYSIS, 2024, 103 (17) : 3267 - 3294
[49] ON FIXED POINT ALGORITHMS FOR SOLVING SPLIT INVERSE PROBLEMS WITH APPLICATIONS
Ogunleye O.
Mewomo O.T.
Alakoya T.O.
Iyiola O.S.
Applied Set-Valued Analysis and Optimization, 2023, 5 (03): : 451 - 476
[50] Network Device Allocation Optimization Using Genetic Algorithms
Falbo, Jason Michael Anthony
Dedieu, Stephane
2018 IEEE CANADIAN CONFERENCE ON ELECTRICAL & COMPUTER ENGINEERING (CCECE), 2018,

← 1 2 3 4 5 →