Fast Local D.C. Programming for Optimal Power Allocation in Wireless Networks

Publisher:
IEEE
Publication Type:
Conference Proceeding
Citation:
GLOBECOM - IEEE Global Telecommunications Conference, 2012, pp. ? - ? (5)
Issue Date:
2012-01-19
Full metadata record
Files in This Item:
Filename Description Size
06134078.pdfPublished version172.23 kB
Adobe PDF
Power allocations in an interference-limited wireless network for global maximization of the weighted sum throughput or global maximization of the minimum rate among network links are not only important but also very hard optimization problems due to their nonconvexity nature. Recently developed methods are either unable to locate the global optimal solutions or prohibitively complex for practical applications. This paper exploits the d.c. (difference of two convex functions/sets) structure of either the objective function or constraint of the these global optimization problems to develop efficient iterative algorithms with very low complexity. Numerical results demonstrate that the developed algorithms are able to locate the global optimal solutions by only a few iterations and they are superior to the previously-proposed methods in both performance and computation complexity.Recently developed methods are either unable to locate the global optimal solutions or prohibitively complex for practical applications. This paper exploits the d.c. (difference of two convex functions/sets) structure of either the objective function or constraint of the these global optimization problems to develop efficient iterative algorithms with very low complexity. Numerical results demonstrate that the developed algorithms are able to locate the global optimal solutions by only a few iterations and they are superior to the previously-proposed methods in both performance and computation complexity. © 2011 IEEE.
Please use this identifier to cite or link to this item: