Network utility maximisation: A DC programming approach for Sigmoidal utility function

Network Utility Maximisation for nonconcave utility functions is a challenging problem in Communication Systems. We propose an innovative approach in nonconvex programming framework for the Network Sigmoidal Utility Maximisation which has many applications, in particular in Multimedia and Internet c...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings (International Conference on Advanced Technologies for Communications) S. 50 - 54
Hauptverfasser: Le Thi Hoai An, Pham Dinh Tao
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.10.2013
Schlagworte:
Convergence
Convex functions
DC programming
DCA
Internet
Internet congestion control
Network topology
Network utility maximization
Nonconvex optimization
Optimization
Programming
Sigmoidal utility function
Vectors
ISBN:1479910864, 9781479910861
ISSN:2162-1020
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Network Utility Maximisation for nonconcave utility functions is a challenging problem in Communication Systems. We propose an innovative approach in nonconvex programming framework for the Network Sigmoidal Utility Maximisation which has many applications, in particular in Multimedia and Internet congestion control. Our method is based on DC (Difference of Convex functions) programming and DCA (DC Algorithms) which have been successfully applied to many large-scale (smooth or nonsmooth) nonconvex programs in various areas. A simple DC formulation is proposed that leads to a fast and scalable DCA based algorithm. A distributed version of DCA is developed and some numerical examples are considered. Our algorithm given a global optimal solution in all cases.
ISBN:1479910864
9781479910861
ISSN:2162-1020
DOI:10.1109/ATC.2013.6698075