Nonconvex Optimization with Dual Bounds and Application in Communication Systems

Convex optimization has provided both a powerful tool and an intriguing mentality to the analysis and design of communication systems over the last few years. This paper presents the results of investigation on dual bounds for nonconvex quadratic programming with a nonlinear constraint and an overview of the nonconvex optimization problem in the networked communication systems.