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

This paper addresses a new continuous approach based on the DC (Difference of Convex functions) programming and DC algorithms (DCA) to Binary quadratic programs (BQP) which play a key role in combinatorial optimization. DCA is completely different from other avalaible methods and featured by generating a convergent finite sequence of feasible binary solutions (obtained by solving linear programs with the same constraint set) with decreasing objective values. DCA is quite simple and inexpensive to handle large-scale problems. In particular DCA is explicit, requiring only matrix-vector products for Unconstrained Binary quadratic programs (UBQP), and can then exploit sparsity in the large-scale setting. To check globality of solutions computed by DCA, we introduce its combination with a customized Branch-and-Bound scheme using DC/SDP relaxation. The combined algorithm allows checking globality of solutions computed by DCA and restarting it if necessary and consequently accelerates the B&B approach. Numerical results on several series test problems provided in OR-Library (Beasley in J Global Optim, 8:429–433, 1996), show the robustness and efficiency of our algorithm with respect to standard methods. In particular DCA provides ϵ-optimal solutions in almost all cases after only one restarting and the combined DCA-B&B-SDP always provides (ϵ−)optimal solutions.

[1]  Warren P. Adams,et al.  On the Equivalence Between Roof Duality and Lagrangian Duality for Unconstrained 0-1 Quadratic Programming Problems , 1994, Discret. Appl. Math..

[2]  Henry Wolkowicz,et al.  A Recipe for Semidefinite Relaxation for , 1995 .

[3]  John E. Beasley,et al.  Heuristic algorithms for the unconstrained binary quadratic programming problem , 1998 .

[4]  Warren P. Adams,et al.  A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems , 1986 .

[5]  Le Thi Hoai An,et al.  A Combined D.C. Optimization—Ellipsoidal Branch-and-Bound Algorithm for Solving Nonconvex Quadratic Programming Problems , 1998, J. Comb. Optim..

[6]  L. Muu,et al.  Simplicially-Constrained DC Optimization over Efficient and Weakly Efficient Sets , 2003 .

[7]  Henry Wolkowicz,et al.  Handbook of Semidefinite Programming , 2000 .

[8]  W. Gander,et al.  A D.C. OPTIMIZATION ALGORITHM FOR SOLVING THE TRUST-REGION SUBPROBLEM∗ , 1998 .

[9]  Le Thi Hoai An,et al.  Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems , 1995, Oper. Res. Lett..

[10]  B. Jaumard,et al.  A Simple Enumerative Algorithm for Unconstrained 0-1 Quadratic Programming , 2000 .

[11]  D. J. Laughhunn.  Quadratic Binary Programming with Application to Capital-Budgeting Problems , 1970, Oper. Res..

[12]  F. Glover,et al.  Adaptive Memory Tabu Search for Binary Quadratic Programs , 1998 .

[13]  Alain Billionnet,et al.  Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem , 2007, Math. Program..

[14]  R. Horst,et al.  Global Optimization: Deterministic Approaches , 1992 .

[15]  T. Q. Phong,et al.  On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method , 1996 .

[16]  Panos M. Pardalos,et al.  Introduction to Global Optimization , 2000, Introduction to Global Optimization.

[17]  Le Thi Hoai An,et al.  The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems , 2005, Ann. Oper. Res..

[18]  Hoai An Le Thi,et al.  Solving a Class of Linearly Constrained Indefinite Quadratic Problems by D.C. Algorithms , 1997 .

[19]  T. P. Dinh,et al.  Convex analysis approach to d.c. programming: Theory, Algorithm and Applications , 1997 .

[20]  R. Saigal,et al.  Handbook of semidefinite programming : theory, algorithms, and applications , 2000 .

[21]  C. Lemaréchal,et al.  SDP Relaxations in Combinatorial Optimization from a Lagrangian Viewpoint , 2001 .

[22]  C. Helmberg,et al.  Solving quadratic (0,1)-problems by semidefinite programs and cutting planes , 1998 .

[23]  Le Thi Hoai An,et al.  A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem , 1998, SIAM J. Optim..

[24]  P. Pardalos,et al.  Graph separation techniques for quadratic zero-one programming , 1991 .

[25]  C. Helmberg.  Semidefinite Programming for Combinatorial Optimization , 2000 .

[26]  Harvey J. Greenberg,et al.  Quadratic Binary Programming Models in Computational Biology , 2008, Algorithmic Oper. Res..

[27]  Le Thi Hoai An,et al.  Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming , 2008, Optim. Methods Softw..

[28]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[29]  Panos M. Pardalos,et al.  Computational aspects of a branch and bound algorithm for quadratic zero-one programming , 1990, Computing.

[30]  Franz Rendl,et al.  A Spectral Bundle Method for Semidefinite Programming , 1999, SIAM J. Optim..

[31]  Panos M. Pardalos,et al.  Advances in Convex Analysis and Global Optimization , 2001 .

[32]  John E. Beasley,et al.  Obtaining test problems via Internet , 1996, J. Glob. Optim..

[33]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[34]  Le Thi Hoai An,et al.  Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach , 2003, SIAM J. Optim..