An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs

Journal of Global Optimization

Volumn 48, Issue 4, 2010, Pages 595-632

  Pham Dinh, Tao ^a   Nguyen Canh, Nam ^a   Le Thi, Hoai An ^b  

^a Avenue de l Université 76801 Saint Etienne du Rouvray   (France)

^b UNIVERSITÉ DE LORRAINE   (France)

Author keywords

Binary quadratic programming (BQP); Branch and bound (B B); DC algorithms (DCA); DC programming; DC relaxation; Exact penalty; Nonconvex quadratic programming; Semidefinite programming (SDP)

Indexed keywords

BINARY QUADRATIC PROGRAMMING; BRANCH AND BOUNDS; D-C PROGRAMMING; DC ALGORITHM; DC RELAXATION; EXACT PENALTIES; NON CONVEX QUADRATIC PROGRAMMING; SEMI-DEFINITE PROGRAMMING;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; MATHEMATICAL PROGRAMMING; NUMERICAL METHODS; OPTIMAL SYSTEMS; PREDICTIVE CONTROL SYSTEMS;

QUADRATIC PROGRAMMING;

EID: 78149282159     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-009-9507-y     Document Type: Article

References (44)

1. W.P. Adams P.M. Dearing 1994 On the equivalence between roof duality and Lagrangian duality for unconstrained 0-1 quadratic programming problems Discrete Appl. Math. 48 1 1 20 10.1016/0166-218X(92)00119-7
2. W.P. Adams H.D. Sherali 1986 A tight linearization and an algorithm for 0-1 quadratic programming problems Manag. Sci. 32 10 1274 1290 10.1287/mnsc.32.10.1274
3. Beasley, J.E.: Obtaining test problems via internet. J. Global Optim. 8, 429-433 (1996). http://people.brunel.ac.uk/~mastjjb/jeb/info.html
4. Beasley, J.E.: Heuristic algorithms for unconstrained binary quadratic programming problem. Technical report, The management school, Imperial college, London SW7 2AZ, England (1998)
5. A. Billionnet S. Elloumi 2007 Using a mixed integer quadratic programming solver for unconstrained quadratic 0-1 problem Math. Program. 109 1, Ser.A 55 68 10.1007/s10107-005-0637-9
6. Delaporte, G., Jouteau, S., Roupin, F.: SDP S :A tool to formulate and solve semidefinite relaxations for bivalent quadratic problems (2002). http://semidef.free.fr/
7. Fujisawa, K., Kojima, M., Nakata, K., Yamashita, M.: SDPA-Users manual version 6.00. Research reports on Mathematical and Computing Sciences, Tokyo Institue of Technology (2002)
8. F. Glover G.A. Kochenberger B. Alidaee 1998 Adaptive memory tabu search for binary quadratic programs Manag. Sci. 44 336 345 10.1287/mnsc.44.3.336
9. P.L. Hammer 1968 Plant location-A pseudo-Boolean approach Isr. J. Technol. 6 330 332
10. Hammer P.L., Rudeanu S.: Boolean Methods in Operations Research. Springer, New York (1968)
11. Hansen, P., Jaumard, B., Meyer, C.: A simple enumerative method algorithm for unconstrained 0-1 quadratic programming. Technical ReportG-2000-59, Les Cahiers du GERAD (2000)
12. Helmberg, C.: Semidefinite programming for combinatorial optimization, ZIB-Report 00-34, Oct (2000)
13. C. Helmberg F. Rendl 1998 Solving quadratic 0-1 problem by semidefinite programs and cutting planes Math. Program. 82 3 291 315 10.1007/BF01580072
14. C. Helmberg F. Rendl 2000 A spectral bundle method for semidefinite programming SIAM J. Optim. 10 3 673 696 10.1137/S1052623497328987
15. Hiriart Urruty J.B., Lemaréchal C.: Convex Analysis and Minimization Algorithms. Springer, Berlin, Heidelberg (1993)
16. Horst R., Tuy H.: Global Optimization: Deterministic Approaches, 3rd edn. Springer, Berlin (2000)
17. Horst R., Pardalos P.M., Thoai N.: Introduction to Global Optimization, 2nd edn. Kluwer, Dordrecht (2000)
18. ILOG. CPLEX 7.5. Ilog cplex 7.5 reference manual. ILOG CPLEX Division, Gentile, France. http://www.ilog.com/products/cplex
19. S. Jha P.M. Pardalos 1991 Graph separation techniques for quadratic 0-1 programming Comput. Math. Appl. 21 6/7 107 113
20. D.J. Laughunn 1970 Quadratic binary programming Oper. Res. 14 454 461 10.1287/opre.18.3.454
21. Le Thi, H.A.: Contribution à l'optimisation non convexe et l'optimisation globale: Théorie, Algorithmes et Applications, Habilitation à Diriger des recherches, Université de Rouen, Juin (1997)
22. H.A. Le Thi T. Pham Dinh 1997 Solving a class of linearly constrained indefinite quadratic problems by DC algorithms J. Global Optim. 11 253 285 10.1023/A:1008288411710
23. H.A. Le Thi T. Pham Dinh 1998 DC optimization algorithms for solving the trust region subproblem SIAM J. Optim. 8 476 505 10.1137/S1052623494274313
24. H.A. Le Thi T. Pham Dinh 1998 A combined DC optimization -ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems J. Comb. Optim. 2 1 9 29 10.1023/A:1009777410170
25. H.A. Le Thi T. Pham Dinh 2001 A continuous approach for large-scale constrained quadratic zero-one programming (In honor of Professor ELSTER, Founder of the Journal Optimization) Optimization 45 3 1 28
26. H.A. Le Thi T. Pham Dinh 2003 Large scale molecular optimization from distance matrices by a DC optimization approach SIAM J. Optim. 14 1 77 117 10.1137/S1052623498342794
27. Le Thi, H.A., Pham Dinh, T.: DC programming approaches and DCA for globally solving linear complementarity problems, Research Report, National Institute for Applied Sciences, Rouen (2004)
28. H.A. Le Thi T. Pham Dinh 2005 The DC programming and DCA revisited with DC models of real world nonconvex optimization problems Ann. Oper. Res. 133 23 46 10.1007/s10479-004-5022-1
29. Le Thi, H.A., Pham Dinh, T., Huynb Van, N.: Exact penalty techniques in DC programming, Research Report, National Institute for Applied Sciences, Rouen (2005)
30. H.A. Le Thi T. Pham Dinh M. Le Dung 1999 Exact penalty in DC programming Vietnam J. Math. 2 169 178
31. H.A. Le Thi T. Pham Dinh M. Le Dung 2003 Simplicially constrained D.C. optimization over the efficient and weakly efficient sets J. Optim. Theory Appl. 117 503 521 10.1023/A:1023993504522
32. Le Thi, H.A., Pham Dinh, T., Nguyen Canh, N.: Local and global approaches based on DC programming, branch-and-bound and SDP techniques for nonconvex quadratic programming, Research Report, National Institute for Applied Sciences, Rouen (2005)
33. Lemaréchal C., Oustry F.: SDP relaxations in combinatorial optimization from a Lagrangian point of view. In: Hadjisavvas, N., Pardalos, P.M. (eds) Advances in Convex Analysis and Global Optimization, pp. 119-134. Kluwer, Dordrecht (2001)
34. Nam, N.C.: Approches Locales et Globales basées sur la Programmation DC & DCA et les Techniques B&B avec Relaxation SDP pour certaines classes des programmes non convexes. Simulations Numériques et Codes à l'Usage Industriel, PhD thesis, National Institute for Applied Sciences-Rouen, France (2007)
35. P.M. Pardalos G.P. Rodgers 1990 Computational aspects of a branch and bound algorithm for quadratic zero-one programming Computing 45 131 144 10.1007/BF02247879
36. T. Pham Dinh H.A. Le Thi 1997 Convex analysis approach to DC programming: theory, algorithms and applications Acta Math. Vietnamica, dedicated to Professor Hoang Tuy on the occasion of his 70th birthday 70 1 289 357
37. T. Pham Dinh H.A. Le Thi 1998 DC optimization algorithms for solving the trust region subproblem SIAM J. Optim. 8 476 505 10.1137/S1052623494274313
38. Pham Dinh, T., Le Thi, H.A., Akoa, F.: Combining DCA and interior point techniques for large-scale nonconvex quadratic programming, optimization, methods and softwares. 23(4), 609-629 (2008)
39. S. Poljak F. Rendl H. Wolkowicz 1995 A recipe for semidefinite relaxation for (01)-quadratic programming J. Global Optim. 7 51 73 10.1007/BF01100205
40. Rockafeller R.T.: Convex Analysis. Princeton University, Princeton (1970)
41. P. Thai Quynh H.A. Le Thi T. Pham Dinh 1996 Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems Oper. Res. Lett. 17 215 222
42. P. Thai Quynh H.A. Le Thi T. Pham Dinh 1996 On the global solution of linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method RAIRO, Rech. Opér. 30 1 31 49
43. Wiegele, A.: Big Mac library. http://biqmac.uni-klu.ac.at/biqmaclib.html (2007)
44. Wolkowicz H., Saigal R., Vandenberghe L.: Handbook of Semidefinite Programming-Theory, Algorithms, and Application. Kluwer, Dordrecht (2000)