http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
A SUCCESSIVE QUADRATIC PROGRAMMING ALGORITHM FOR SDP RELAXATION OF THE BINARY QUADRATIC PROGRAMMING
MU XUEWEN,LID SANYANG,ZHANG YALING Korean Mathematical Society 2005 대한수학회보 Vol.42 No.4
In this paper, we obtain a successive quadratic programming algorithm for solving the semidefinite programming (SDP) relaxation of the binary quadratic programming. Combining with a randomized method of Goemans and Williamson, it provides an efficient approximation for the binary quadratic programming. Furthermore, its convergence result is given. At last, We report some numerical examples to compare our method with the interior-point method on Maxcut problem.
A successive quadratic programming algorithm for SDP relaxation of the binary quadratic programing
Xuewen Mu,Sanyang Liu,Yaling Zhang 대한수학회 2005 대한수학회보 Vol.42 No.4
In this paper, we obtain a successive quadratic pro-gramming algorithm for solving the semidenite programming (SDP)relaxation of the binary quadratic programming. Combining witha randomized method of Goemans and Williamson, it provides anecient approximation for the binary quadratic programming. Fur-thermore, its convergence result is given. At last, We report somenumerical examples to compare our method with the interior-pointmethod on Maxcut problem.