Depth-first simplicial partition for copositivity detection, with an application to MaxClique

Optimization Methods and Software

Volumn 26, Issue 3, 2011, Pages 499-510

  Žilinskas, Julius ^a   Dür, Mirjam ^b  

^a VILNIUS UNIVERSITY   (Lithuania)

^b UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

copositive matrices; MaxClique; simplicial partition

Indexed keywords

COPOSITIVE MATRICES; DEPTH FIRST; LINEAR-ALGEBRAIC; MAX-CLIQUE PROBLEM; MAXCLIQUE; MEMORY REQUIREMENTS; NUMERICAL RESULTS; PARTITION ALGORITHMS; QUADRATIC OPTIMIZATION; RANDOM PROBLEM; SIMPLICIAL PARTITION; SUB-MATRICES;

ALGORITHMS; MATRIX ALGEBRA;

PROBLEM SOLVING;

EID: 80051720515     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556788.2010.544310     Document Type: Article

References (30)

1. L.-E. Andersson, G. Chang, and T. Elfving, Criteria for copositive matrices using simplices and barycentric coordinates, Linear Algebra Appl. 220(15) (1995), pp. 9-30.
2. DIMACS Graph Generators. Available at ftp://dimacs.rutgers.edu/pub/ challenge/graph/contributed/.
3. DIMACS Clique Benchmarks Available at ftp://dimacs.rutgers.edu/pub/ challenge/graph/benchmarks/clique/.
4. I.M. Bomze, Remarks on the recursive structure of copositivity, J. Inform. Optim. Sci. 8(3) (1987), pp. 243-260.
5. I.M. Bomze, Block pivoting and shortcut strategies for detecting copositivity, Linear Algebra Appl. 248 (1996), pp. 161-184.
6. I.M. Bomze, Perron-Frobenius property of copositive matrices, and a block copositivity criterion, Linear Algebra Appl. 429(1) (2008), pp. 68-71.
7. I.M. Bomze and G. Eichfelder, Copositivity detection by difference-of-convex decomposition and w-subdivision, preprint. Available at http://www.optimization-online.org/DB-HTML/2010/01/2523.html.
8. I.M. Bomze, M. Dür, E. de Klerk, C. Roos, A.J. Quist, and T. Terlaky, On copositive programming and standard quadratic optimization problems, J. Global Optim. 18(4) (2000), pp. 301-320.
9. M. Brockington and J.C. Culberson, Camouflaging independent sets in quasi-random graphs, in Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick, eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26, AMS, Providence, RI, 1996, pp. 75-88.
10. S. Bundfuss and M. Dür, Algorithmic copositivity detection by simplicial partition, Linear Algebra Appl. 428(7) (2008), pp. 1511-1523. (Pubitemid 351191953)
11. S. Burer, On the copositive representation of binary and continuous nonconvex quadratic programs, Math. Program. 120(2) (2009), pp. 479-495.
12. F. Della Croce, A. Grosso, and M. Locatelli, A heuristic approach for the max-min diversity problem based on max-clique, Comp. Oper. Res. 36(8) (2009), pp. 2429-2433.
13. I. Dukanovic and F. Rendl, Copositive programming motivated bounds on the stability and the chromatic numbers, Math. Program. 121(2) (2010), pp. 249-268.
14. M. Dür, Copositive programming-a survey, inRecent Advances in Optimization and its Applications in Engineering, M. Diehl, F. Glineur, E. Jarlebring, andW. Michiels, eds. Berlin/Heidelberg: Springer, 2010, pp. 3-20.
15. J. Hasselberg, P.M. Pardalos, and G.Vairaktarakis, Test case generators and computational results for the maximum clique problem, J. Global Optim. 3(4) (1993), pp. 463-482.
16. A. Jagota, Approximating max-clique with a hopfield network, Technical Report 92-33, University at Buffalo, Computer Science, 1992. Available from the author only.
17. D.S. Johnson and M.A. Trick, eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science. vol. 26, AMS, Providence, RI, 1996.
18. W. Kaplan, A test for copositive matrices, Linear Algebra Appl. 313(1-3) (2000), pp. 203-206.
19. W. Kaplan, A copositivity probe, Linear Algebra Appl. 337(1-3) (2001), pp. 237-251. (Pubitemid 33676068)
20. E. de Klerk and D.V. Pasechnik, Approximation of the stability number of a graph via copositive programming, SIAM J. Optim. 12(4) (2002), pp. 875-892.
21. J.C. Lagarias and P.W. Shor, Keller's cube-tiling conjecture is false in high dimensions, Bull.Amer.Math. Soc. 27(2) (1992), pp. 279-283.
22. K.G. Murty and S.N. Kabadi, Some NP-complete problems in quadratic and nonlinear programming, Math. Program. 39(2) (1987), pp. 117-129.
23. P.M. Pardalos and G.P. Rodgers, A branch and bound algorithm for the maximum clique problem, Comp. Oper. Res. 19(5) (1992), pp. 363-375.
24. J. Povh and F. Rendl, A copositive programming approach to graph partitioning, SIAM J. Optim. 18(1) (2007), pp. 223-241. (Pubitemid 351271329)
25. J. Povh and F. Rendl, Copositive and semidefinite relaxations of the quadratic assignment problem, Discrete Optim. 6(3) (2009), pp. 231-241.
26. L.A. Sanchis and A. Jagota, Some experimental and theoretical results on test case generators for the maximum clique problem, INFORMS J. Comp. 8(2) (1996), pp. 87-102. (Pubitemid 126681521)
27. H. Väliaho, Criteria for copositive matrices, Linear Algebra Appl. 81 (1986), pp. 19-34.
28. S. Yang and X. Li, Algorithms for determining the copositivity of a given symmetric matrix, Linear Algebra Appl. 430(2-3) (2009), pp. 609-618.
29. J. Žilinskas, Branch and bound with simplicial partitions for global optimization, Math. Model. Anal. 13(1) (2008), pp. 145-159.
30. A. Žilinskas and J. Žilinskas, Branch and bound algorithm for multidimensional scaling with city-block metric, J. Global Optim. 43(2-3) (2009), pp. 357-372.