JOURNAL BROWSE
Search
Advanced SearchSearch Tips
 HOME > Journal Browse > About Journal > Journal Vol & Issue > Full Record
A SUCCESSIVE QUADRATIC PROGRAMMING ALGORITHM FOR SDP RELAXATION OF THE BINARY QUADRATIC PROGRAMMING
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
A SUCCESSIVE QUADRATIC PROGRAMMING ALGORITHM FOR SDP RELAXATION OF THE BINARY QUADRATIC PROGRAMMING
MU XUEWEN; LID SANYANG; ZHANG YALING;
  PDF(new window)
 Abstract
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.
 Keywords
binary quadratic programming;successive quadratic programming algorithm;semidefinite programming;randomized method;
 Language
English
 Cited by
 References
1.
F. Barahon and M. Grotschel, An application of combinatorial optimization to statiscal optimization and circuit layout design, Oper. Res. 36 (1998), no. 3, 493-513 crossref(new window)

2.
K. C. Chang and D. H., Eifficient algorithms for layer assignment problems, IEEE Trans. on Computer Aided Design. CAD-6 (1987), no. 1, 67-78

3.
R. Chen, A graph theoretic via minimization algorithm for teo layer printed circuit boards, IEEE Trans. Circuits Systems CAS 30 (1983), no. 5, 284-299 crossref(new window)

4.
M. X. Goeman and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiably problem using semidefinite programming, J. ACM 42 (1995), 1115-1145 crossref(new window)

5.
S. Benson, Y. Ye, and X. Zhang, Solving large scale sprase semidefinite programming for combinatorial optimization, SIAM J. Optim. 10 (2000), no. 2, 443-461 crossref(new window)

6.
C. Helberg and F. Rendel, An interior point method for semidefinite programming, SIAM J. Optim. 10 (1990), 842-861

7.
C. Helberg and F. Rendl, A spectral bundle method for semidefinite programing, SIAM J. Optim. 10 (2000), 673-696 crossref(new window)

8.
M. Peinadoo and S. Homer, Design and performance of parallel and distributed approximation algorithms for max-cut, Journal of Parallel and Distributed Computing. 9 (1998), 141-160

9.
S. Burer and R. D. C. Monteriro, A projected gradient algorithm for solving the max-cut relaxation, Optim. Methods Softw. 15 (2001), 175-200 crossref(new window)

10.
M. Marko, Makeka, and Pekka Neittaanmaki, Nonsmooth optimization: analysis and algorithms with application to optimization control, World scientific, Singapore, 1992

11.
C. Helmberg, Semidefinite programming for combinatorial optimization, Konrad- Zuse-Zentrum fur informationstechnik Berlin, Germany, 2000

12.
M. V. Nayakakuppam, M. L. Overton, and S. Schemita, SDPpack user's guide- version 0.9 Beta, Technical Report Yr 1997-737, Courtant Institute of Mathematical Science, NYU, New York, NY, 1997

KISTIKorea Institute of Science and Technology Information Contact to : koreascience@kisti.re.kr Copyright@2012 KISTI All Rights Reserved. For more information mail to webmaster.