DocumentCode :
3253290
Title :
Distributed algorithm design for network optimization problems with coupled objectives
Author :
Huang, Jianwei
Author_Institution :
Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Hong Kong, China
fYear :
2009
fDate :
23-26 Jan. 2009
Firstpage :
1
Lastpage :
6
Abstract :
This paper establishes a framework for designing fast, robust, and distributed algorithms for solving network utility maximization problems with coupled objective functions. We use two case studies in wireless communications to illustrate the key ideas: reverse-engineering the algorithm based on the KKT conditions of the optimization problem, and proving the properties of the algorithms using monotone mapping, contraction mapping, and supermodular game theory.
Keywords :
distributed algorithms; game theory; optimisation; radio networks; KKT condition; Karush-Kuhn-Tucker condition; contraction mapping; distributed algorithm; monotone mapping; network utility maximization; reverse-engineering; supermodular game theory; Algorithm design and analysis; Convergence; Design engineering; Design optimization; Distributed algorithms; Interference constraints; Message passing; Pricing; Robustness; Utility programs;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
TENCON 2009 - 2009 IEEE Region 10 Conference
Conference_Location :
Singapore
Print_ISBN :
978-1-4244-4546-2
Electronic_ISBN :
978-1-4244-4547-9
Type :
conf
DOI :
10.1109/TENCON.2009.5395911
Filename :
5395911
Link To Document :
بازگشت