We study the problem of semidefinite relaxation (SDR) for detection of symbols transmitted over a general MIMO channel. In the SDR detector the maximum likelihood detection problem is relaxed into a semidefinite program (SDP) which is solved numerically using an interior-point path-following algorithm. Herein, we provide a criteria which, based on the channel matrix realization, determine the accuracy required by the SDP solver to give a good bit error rate performance of the overall SDR detector. This also reduce the complexity of the SDR detector as it limits the number of interior iterations required in the SDP solver. The performance is demonstrated through simulations.