separately by employing convex semidefinite programming through rank-one relaxation. It is shown that our proposed algorithm outperforms conventional relay selection and BF schemes....

that the optimization problem is turned into a semidefinite programming problem with bilinear constraints. These problems can be solved using numerical or any other methods. Finally, to check the effectiveness of the method, we have listed a numerical example....