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

<table>Probability of rank-one solution against the error bound <svg height="11.9625" id="M448" style="vertical-align:-3.39066pt" version="1.1" viewbox="0 0 13.9375 11.9625" width="13.9375" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,7.675)"><path d="M401 397q0 -24 -24 -40q-18 -13 -31 3q-36 45 -93 45q-48 0 -86.5 -43t-51.5 -112l206 6l-8 -48l-203 6v-25q0 -68 26.5 -107t73.5 -39q73 0 148 64l16 -22q-40 -44 -91 -70.5t-102 -26.5q-75 0 -116.5 45t-41.5 136q0 125 99 208q36 30 87 50.5t93 20.5q46 0 72.5 -16
t26.5 -35z" id="x1D716"></path></g>
<g transform="matrix(.012,-0,0,-.012,7.275,11.762)"><path d="M480 416q0 -21 -18 -41q-9 -11 -17 -7q-20 9 -42 9q-62 0 -140 -78q23 -69 88 -192q17 -31 27 -42t20 -11q16 0 62 46l17 -20q-64 -92 -119 -92q-35 0 -70 66q-41 73 -84 187q-36 -30 -62 -61q-27 -115 -35 -172q-41 -8 -78 -20l-6 6l140 612q7 28 0.5 34t-37.5 7l-34 1
l5 26q38 4 74 13.5t57 17t25 7.5q12 0 4 -32l-104 -443h2q35 38 97 93q39 35 65.5 56t62 41.5t58.5 20.5q19 0 30.5 -10t11.5 -22z" id="x1D458"></path></g>
</svg>.</table>

Mathematical Problems in Engineering

fig4

Figure 4

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