Nonsmooth optimization for beamforming in cognitive multicast transmission

Publication Type:
Conference Proceeding
GLOBECOM - IEEE Global Telecommunications Conference, 2010
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2010003585OK.pdf184.28 kB
Adobe PDF
It is well-known that the optimal beamforming problems for cognitive multicast transmission are indefinite quadratic (nonconvex) optimization programs. The conventional approach is to reformulate them as convex semi-definite programs (SDPs) with additional rank-one (nonconvex and discontinuous) constraints. The rank-one constraints are then dropped for relaxed solutions, and randomization techniques are employed for solution search. In many practical cases, this approach fails to deliver satisfactory solutions, i.e., its found solutions are very far from the optimal ones. In contrast, in this paper we cast the optimal beamforming problems as SDPs with the additional reverse convex (but continuous) constraints. An efficient algorithm of nonsmooth optimization is then proposed for seeking the optimal solution. Our simulation results show that the proposed approach yields almost global optimal solutions with much less computational load than the mentioned conventional one. ©2010 IEEE.
Please use this identifier to cite or link to this item: