Nonsmooth Optimization for Efficient Beamforming in Cognitive Radio Multicast Transmission

It is known that the design of optimal transmit beam-forming vectors for cognitive radio multicast transmission can be formulated as indefinite quadratic optimization programs. Given the challenges of such non-convex problems, the conventional approach in literature is to recast them as convex Semi-Definite Programs (SDPs) together with rank-one constraints. Then, these non-convex and discontinuous constraints are dropped allowing for the realization of a pool of relaxed candidate solutions, from which various randomization techniques are utilized with the hope to recover the optimal solutions.

Provided by: Institute of Electrical & Electronic Engineers Topic: Mobility Date Added: Jun 2012 Format: PDF

Find By Topic