A new kind of algorithm for semidefinite programming is presented by using theGolden Section Method, which sufficiently utilizes structure of the set of feasiblesolutions. Because of the simplicity and less operations, the algorithm can be usedto solve large scale problems. As a successful application, a numerical example ofMax-cut problem is given.
In this paper, a detection strategy based on a semidefinite relaxation of the CDMA maximum-likelihoodmultiuser detection is investigated. Coordinate descent algorithm is used to strengthen the approximation. The simu-lated bit-error-rate performance demonstrates that this approach provides a good approximation to the maximum-like-lihood multiuser detection.
