A recipe for semidefinite relaxation for (0,1)-quadratic programming

We review various relaxations of (0,1)-quadratic programming problems. These include semidefinite programs, parametric trust region problems and concave quadratic maximization. All relaxations that we consider lead to efficiently solvable problems. The main contributions of the paper are the following. Using Lagrangian duality, we prove equivalence of the relaxations in a unified and simple way. Some of these equivalences have been known previously, but our approach leads to short and transparent proofs. Moreover we extend the approach to the case of equality constrained problems by taking the squared linear constraints into the objective function. We show how this technique can be applied to the Quadratic Assignment Problem, the Graph Partition Problem and the Max-Clique Problem. Finally we show our relaxation to be best possible among all quadratic majorants with zero trace.

[1]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[2]  Willem H. Haemers,et al.  On Some Problems of Lovász Concerning the Shannon Capacity of a Graph , 1979, IEEE Trans. Inf. Theory.

[3]  Alexander Schrijver,et al.  A comparison of the Delsarte and Lovász bounds , 1979, IEEE Trans. Inf. Theory.

[4]  H. Wolkowicz,et al.  Some applications of optimization in matrix theory , 1981 .

[5]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[6]  Jorge J. Moré,et al.  Computing a Trust Region Step , 1983 .

[7]  David G. Luenberger,et al.  Linear and nonlinear programming , 1984 .

[8]  Pierre Hansen,et al.  Roof duality, complementation and persistency in quadratic 0–1 optimization , 1984, Math. Program..

[9]  G. Finke.  Quadratic Assignment Problems , 1987 .

[10]  F. Körner.  A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm 1 , 1988 .

[11]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[12]  P. Körner.  Remarks on a difficult test problem for quadratic boolean programming , 1992 .

[13]  Panos M. Pardalos,et al.  The Quadratic Assignment Problem: A Survey and Recent Developments , 1993, Quadratic Assignment and Related Problems.

[14]  Egon Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[15]  Charles Delorme,et al.  Laplacian eigenvalues and the maximum cut problem , 1993, Math. Program..

[16]  David P. Williamson,et al.  .879-approximation algorithms for MAX CUT and MAX 2SAT , 1994, STOC '94.

[17]  Donald E. Knuth.  The Sandwich Theorem , 1994, Electron. J. Comb..

[18]  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..

[19]  Henry Wolkowicz,et al.  Convex Relaxations of (0, 1)-Quadratic Programming , 1995, Math. Oper. Res..

[20]  Franz Rendl,et al.  A projection technique for partitioning the nodes of a graph , 1995, Ann. Oper. Res..

[21]  Henry Wolkowicz,et al.  Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations , 1995, SIAM J. Optim..