By Topic

Distributed algorithm design for network optimization problems with coupled objectives

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Jianwei Huang ; Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Hong Kong, China

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.

Published in:

TENCON 2009 - 2009 IEEE Region 10 Conference

Date of Conference:

23-26 Jan. 2009