Tightness of Semidefinite Programming Relaxation to Robust Transmit Beamforming with SINR Constraints

Abstract EN

This paper considers a multiuser transmit beamforming problem under uncertain channel state information (CSI) subject to SINR constraints in a downlinkmultiuser MISO system.

A robust transmit beamforming formulation is proposed.

This robust formulation is to minimize the transmission power subject to worst-case signal-to-interference-plus-noise ratio (SINR) constraints on the receivers.

The challenging problem is that the worst-case SINR constraints correspond to an infinite number of nonconvex quadratic constraints.

In this paper,a natural semidifinite programming (SDP) relaxation problem is proposed to solve the robust beamforming problem.

The main contribution of this paper is to establish the tightness of the SDP relaxation problem under proper assumption, which means that the SDP relaxation problem definitely yields rank-one solutions under the assumption.

Then the SDP relaxation problem provides globally optimum solutions of the primal robust transmit beamforming problem under proper assumption and norm-constrained CSI errors.

Simulation results show the correctness of the proposed theoretical results and also provide a counterexample whose solutions are not rank one.

The existence of counterexample shows that the guess that the solutions of the SDP relaxation problem must be rank one is wrong, except that some assumptions (such as the one proposed in this paper) hold.