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

<table>Feasibility rate (<svg height="11.75" id="M414" style="vertical-align:-0.4368pt" version="1.1" viewbox="0 0 12.975 11.75" width="12.975" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.15)"><path d="M594 629l-404 -661l-31 23l402 661zM194 635q70 0 107 -56t37 -125t-37.5 -125.5t-107.5 -56.5t-107 56.5t-37 124.5q0 70 37.5 126t107.5 56zM193 605q-28 0 -45 -29t-21.5 -59.5t-4.5 -62.5t4.5 -63t22 -60t45.5 -29q22 0 37.5 16t22 42t9 48t2.5 45q0 152 -72 152z
M567 351q69 0 106 -56t37 -125t-37 -125.5t-107 -56.5t-107.5 56.5t-37.5 124.5q0 43 14.5 83t49 69.5t82.5 29.5zM566 322q-28 0 -45 -28.5t-22 -59.5t-5 -64q0 -23 3 -46t10.5 -48.5t23 -41.5t36.5 -16q28 0 45 29.5t21 59.5t4 62q0 24 -2.5 46.5t-9.5 48.5t-22 42t-37 16
z" id="x25"></path></g>
</svg>) versus target SINR <svg height="12.175" id="M415" style="vertical-align:-3.56265pt" version="1.1" viewbox="0 0 8.6374998 12.175" width="8.6374998" 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="M478 372q0 -39 -31 -97t-61 -98t-78 -98q-45 -55 -73 -102q-13 -79 -13 -197q-11 -11 -43.5 -25.5t-53.5 -15.5l-15 17q5 35 26 101.5t47 123.5q8 72 -1.5 174.5t-37.5 178.5q-14 37 -29 37q-20 0 -67 -65l-25 21q37 60 73 90.5t63 30.5q47 0 72 -112q13 -56 17.5 -141.5
t0.5 -143.5h2q155 193 155 297q0 26 -12 47q-5 8 -5 15q0 16 12.5 27t29.5 11q21 0 34 -21t13 -55z" id="x1D6FE"></path></g>
</svg>.</table>

Mathematical Problems in Engineering

fig1

Figure 1

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