Monotonic Optimization in Communication and Networking Systems

被引:130
作者
Zhang, Ying Jun Angela [1 ]
Qian, Liping [2 ]
Huang, Jianwei [1 ]
机构
[1] Chinese Univ Hong Kong, Dept Informat Engn, Hong Kong, Hong Kong, Peoples R China
[2] Zhejiang Univ Technol, Coll Informat Engn, Hangzhou, Zhejiang, Peoples R China
来源
FOUNDATIONS AND TRENDS IN NETWORKING | 2012年 / 7卷 / 01期
关键词
D O I
10.1561/1300000038
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Optimization has been widely used in recent design of communication and networking systems. One major hurdle in this endeavor lies in the nonconvexity of many optimization problems that arise from practical systems. To address this issue, we observe that most nonconvex problems encountered in communication and networking systems exhibit monotonicity or hiddenmonotonicity structures. A systematic use of the monotonicity properties would substantially alleviate the difficulty in obtaining the global optimal solutions of the problems. This monograph provides a succinct and accessible introduction to monotonic optimization, including the formulation skills and solution algorithms. Through several application examples, we will illustrate modeling techniques and algorithm details of monotonic optimization in various scenarios. With this promising technique, many previously difficult problems can now be solved with great efficiency. With this monograph, we wish to spur new research activities in broadening the scope of application of monotonic optimization in communication and networking systems.
引用
收藏
页码:1 / 75
页数:75
相关论文
共 42 条
[1]   Performance analysis,of the IEEE 802.11 distributed coordination function [J].
Bianchi, G .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2000, 18 (03) :535-547
[2]  
Boyd S., 2004, CONVEX OPTIMIZATION, DOI DOI 10.1017/CBO9780511804441
[3]   A tutorial on geometric programming [J].
Boyd, Stephen ;
Kim, Seung-Jean ;
Vandenberghe, Lieven ;
Hassibi, Arash .
OPTIMIZATION AND ENGINEERING, 2007, 8 (01) :67-127
[4]   Power control by geometric programming [J].
Chiang, Mung ;
Tan, Chee Wei ;
Palomar, Daniel P. ;
O'Neill, Daniel ;
Julian, David .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2007, 6 (07) :2640-2651
[5]  
Fodor G., 2009, IEEE GLOBECOM
[6]   Modeling per-flow throughput and capturing starvation in CSMA multi-hop wireless networks [J].
Garetto, Michele ;
Salonidis, Theodoros ;
Knightly, Edward W. .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2008, 16 (04) :864-877
[7]   SEMIDEFINITE RELAXATION BOUNDS FOR INDEFINITE HOMOGENEOUS QUADRATIC OPTIMIZATION [J].
He, Simai ;
Luo, Zhi-Quan ;
Nie, Jiawang ;
Zhang, Shuzhong .
SIAM JOURNAL ON OPTIMIZATION, 2008, 19 (02) :503-523
[8]  
Hellings C., 2011, P EUR SIGN PROC C BA
[9]   CONCAVE MINIMIZATION VIA CONICAL PARTITIONS AND POLYHEDRAL OUTER APPROXIMATION [J].
HORST, R ;
THOAI, NV ;
BENSON, HP .
MATHEMATICAL PROGRAMMING, 1991, 50 (02) :259-274
[10]   Distributed interference compensation for wireless networks [J].
Huang, JW ;
Berry, RA ;
Honig, ML .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2006, 24 (05) :1074-1084