Fast global optimal power allocation in wireless networks by local D.C. programming

Publication Type:
Journal Article
IEEE Transactions on Wireless Communications, 2012, 11 (2), pp. 510 - 515
Issue Date:
Filename Description Size
Thumbnail2011005447OK.pdfPublished Version269.43 kB
Adobe PDF
Full metadata record
Power allocations in an interference-limited wireless network for global maximization of the weighted sum throughput or global optimization of the minimum weighted 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 constraints of 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. © 2012 IEEE.
Please use this identifier to cite or link to this item: