Nonsmooth Optimization for Beamforming in Cognitive Multicast Transmission

• Published in: 2010 IEEE Global Telecommunications Conference GLOBECOM 2010 pp. 1 - 5
• Main Authors: Phan, A H, Tuan, H D, Kha, H H, Ngo, D T
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.12.2010
• Subjects: Array signal processing; Eigenvalues and eigenfunctions; Interference; Optimization; Receivers; Signal to noise ratio; Simulation
• ISBN: 1424456363; 9781424456369
• ISSN: 1930-529X
• DOI: 10.1109/GLOCOM.2010.5683915

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.