IEEE Transactions on Wireless Communications · 2011 · 344 citations · 23 references
Natural SciencesComputer ScienceMathematicsDesign OptimizationOptimizationWireless CommunicationsConvex OptimizationGlobal OptimizationInterference ManagementNetwork OptimizationNonlinear ProgrammingPower OptimizationConvex FunctionsConvex SetsEfficient Global OptimizationNetwork InterferenceObjective Function FormulationOptimal AllocationPower Allocation
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.
23
Power Control By Geometric Programming
Mung Chiang, Chee Wei Tan, Daniel P. Palomar et al. · IEEE Transactions on Wireless Communications · 2007 · 907 citations
Monotonic Optimization: Problems and Solution Approaches
Hoàng Tụy · SIAM Journal on Optimization · 2000 · 324 citations