Beamforming optimization in multi-user amplify-and-forward wireless relay networks
- Publication Type:
- Journal Article
- IEEE Transactions on Wireless Communications, 2012, 11 (4), pp. 1510 - 1520
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
Optimization problems of beamforming in multi-user amplify-and-forward (AF) wireless relay networks are indefinite (nonconvex) quadratic programs, which require effective computational solutions. Solutions to these problems have often been obtained by relaxing the original problems to semi-definite programs (SDPs) of convex optimization. Most existing works have claimed that these relaxed SDPs actually provide the optimal beamforming solutions. This paper, however, shows that this is not the case in many practical scenarios where SDPs fail to provide even a feasible beamforming solution. To fill this gap, we develop in this paper a nonsmooth optimization algorithm, which provides the optimal solution at low computational complexity. © 2012 IEEE.
Please use this identifier to cite or link to this item: