Cutting planes for semidefinite relaxations based on triangle-free subgraphs

We show how to separate a doubly nonnegative matrix, which is not completely positive and has a triangle-free graph, from the completely positive cone. This method can be used to compute cutting planes for semidefinite relaxations of combinatorial problems. We illustrate our approach by numerical tests on the stable set problem.

[1]  Javier Peña,et al.  Computing the Stability Number of a Graph Via Linear and Semidefinite Programming , 2007, SIAM J. Optim..

[2]  Mirjam Dür,et al.  The difference between 5×5 doubly nonnegative and completely positive matrices , 2009 .

[3]  Peter J. C. Dickinson.  Geometry of the copositive and completely positive cones , 2011 .

[4]  Samuel Burer,et al.  Separation and relaxation for cones of quadratic forms , 2013, Math. Program..

[5]  Samuel Burer,et al.  On the copositive representation of binary and continuous nonconvex quadratic programs , 2009, Math. Program..

[6]  H. Väliaho.  Criteria for copositive matrices , 1986 .

[7]  Mirjam Dür,et al.  Factorization and cutting planes for completely positive matrices by copositive projection , 2014, Math. Program..

[8]  Wilfred Kaplan,et al.  A test for copositive matrices , 2000 .

[9]  Richard W. Cottle,et al.  On classes of copositive matrices , 1970 .

[10]  Kurt M. Anstreicher,et al.  Separating doubly nonnegative and completely positive matrices , 2013, Math. Program..

[11]  A. Berman,et al.  Completely Positive Matrices , 2003 .

[12]  K. P. Hadeler,et al.  On copositive matrices , 1983 .

[13]  Alan J. Hoffman.  On Copositive Matrices with - 1, 0, 1 Entries , 1973, J. Comb. Theory, Ser. A.

[14]  Peter J. C. Dickinson,et al.  On the computational complexity of membership problems for the completely positive cone and its dual , 2014, Comput. Optim. Appl..

[15]  Marco Locatelli,et al.  Copositivity cuts for improving SDP bounds on the clique number , 2010, Math. Program..

[16]  Roland Hildebrand,et al.  The extreme rays of the 5 × 5 copositive cone , 2012 .

[17]  Alan J. Hoffman,et al.  Two remarks on compositive matrices , 1969 .

[18]  Etienne de Klerk,et al.  Approximation of the Stability Number of a Graph via Copositive Programming , 2002, SIAM J. Optim..

[19]  Fabio Tardella,et al.  New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability , 2008, Math. Program..

[20]  Charles R. Johnson,et al.  Completely positive matrices associated with M-matrices , 1994 .