DC programming in communication systems: challenging problems and methods
Nonconvex optimization becomes an indispensable and powerful tool for the analysis and design of Communication Systems (CS) since the last decade. As an innovative approach to nonconvex programming, Difference of Convex functions (DC) programming and DC Algorithms (DCA) are increasingly used by researchers in this field. The objective of this paper is to show that many challenging problems in CS can be modeled as DC programs and solved by DCA-based algorithms. We offer the community of researchers in CS promising approaches in a unified DC programming framework to tackle various applications, such as routing, power control, congestion control of the Internet, resource allocation in networks, etc.
dc programming communication systems dca exact penalty dc constraint mixed 01 dc programs