Copositivity detection by difference-of-convex decomposition and ω-subdivision

Mathematical Programming

Volumn 138, Issue 1-2, 2013, Pages 365-400

  Bomze, Immanuel M ^a   Eichfelder, Gabriele ^b  

^a UNIVERSITY OF VIENNA   (Austria)

^b ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Conic optimization; Linear optimization; Quadratic optimization

Indexed keywords

BRANCH-AND-BOUND ALGORITHMS; CONIC OPTIMIZATION; D.C. DECOMPOSITION; LINEAR OPTIMIZATION; QUADRATIC OPTIMIZATION; TEST POINTS;

ALGORITHMS; OPTIMIZATION;

DECOMPOSITION;

EID: 84875414878     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-012-0543-x     Document Type: Article

References (43)

1. Andersson L.E.; Chang G.; Elfving T.: Criteria for copositive matrices using simplices and barycentric coordinates. Linear Algebra Appl. 220, 9-30 (1995)
2. Bomze I.M.: Copositivity conditions for global optimality in indefinite quadratic programming problems. Czechoslov. J. Oper. Res. 1, 7-19 (1992)
3. Bomze I.M.: Block pivoting and shortcut strategies for detecting copositivity. Linear Algebra Appl. 248, 161-184 (1996)
4. Bomze I.M.: Global escape strategies for maximizing quadratic forms over a simplex. J. Glob. Optim. 11, 325-338 (1997)
5. Bomze I.M.: On standard quadratic optimization problems. J. Glob. Optim. 13, 369-387 (1998)
6. Bomze I.M.: Linear-time copositivity detection for tridiagonal matrices and extension to block-tridiagonality. SIAM J. Matrix Anal. Appl. 21, 840-848 (2000)
7. Bomze I.M.: Perron-Frobenius property of copositive matrices, and a block copositivity criterion. Linear Algebra Appl. 429, 68-71 (2008)
8. Bomze I.M.: Copositive optimization - recent developments and applications. Eur. J. Oper. Res. 216, 509-520 (2012)
9. Bomze I.M.; Budinich M.; Pardalos P.; Pelillo M.: The maximum clique problem. In: Du, D.-Z.; Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization (supp. Vol. A), pp. 1-74. Kluwer, Dordrecht (1999)
10. Bomze I.M.; Dür M.; de Klerk E.; Roos C.; Quist A.J.; Terlaky T.: On copositive programming and standard quadratic optimization problems. J. Glob. Optim. 13, 369-387 (1998)
11. Bomze I.M.; Locatelli M.: Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches. Comput. Optim. Appl. 28, 227-245 (2004)
12. Bomze I.M.; Locatelli M.; Tardella F.: New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability. Math. Program. 115, 31-64 (2008)
13. Bomze I.M.; Schachinger W.; Uchida G.: Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization. J. Glob. Optim. 52, 423-445 (2012)
14. Bundfuss S.; Dür M.: Algorithmic copositivity detection by simplicial partition. Linear Algebra Appl. 428, 1511-1523 (2008)
15. Burer S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. 120, 479-495 (2009)
16. Burer S.: Copositive programming. In: Anjos, M.F.; Lasserre, J.-B. (eds.) Handbook of Semidefinite, Cone and Polynomial Optimization: Theory, Algorithms, Software and Applications, pp. 201-218. Springer, New York (2012)
17. Danninger, G.: A recursive algorithm for determining (strict) copositivity of a symmetric matrix. In: Rieder, U.; et al. (eds.) Methods OR, vol. 62. Hain, Meisenheim, pp. 45-52 (1990)
18. Danninger G.; Bomze I.M.: Using copositivity for global optimality criteria in concave quadratic programming problems. Math. Program. 62, 575-580 (1993)
19. de Klerk E.; Pasechnik D.V.: Approximation of the stability number of a graph via copositive programming. SIAM J. Optim. 12, 875-892 (2002)
20. Diananda P.H.: On non-negative forms in real variables some or all of which are non-negative. Proc. Camb. Phil. Soc. 58, 17-25 (1962)
21. DIMACS: Second DIMACS Challenge. Test instances available at http://dimacs.rutgers.edu/challenges. Last accessed Jan 13. (2010)
22. Dür M.: Copositive programming - a survey. In: Diehl, M.; Glineur, F.; Jarlebring, E.; Michiels, W. (eds.) Recent Advances in Optimization and its Applications in Engineering, pp. 3-20. Springer, New York (2010)
23. Eichfelder G.; Jahn J.: Set-semidefinite optimization. J. Convex Anal. 15, 767-801 (2008)
24. Eichfelder G.; Jahn J.: Foundations of set-semidefinite optimization. In: Pardalos, P.; Rassias, T.M.; Khan, A.A (eds.) Nonlinear Analysis and Variational Problems, pp. 259-284. Springer, New York (2009)
25. Hall M. Jr.; Newman M.: Copositive and completely positive quadratic forms. Proc. Camb. Phil. Soc. 59, 329-339 (1963)
26. Hall M. Jr.: Combinatorial Theory. Blaisdell, Waltham (1967)
27. Haynsworth E.; Hoffman A.J.: Two remarks on copositive matrices. Linear Algebra Appl. 2, 387-392 (1969)
28. Hogben L.; Johnson C.R.; Reams R.: The copositive completion problem. Linear Algebra Appl. 408, 207-211 (2005)
29. Hoffman A.J.; Pereira F.: On copositive matrices with -1, 0, 1 entries. J. Comb. Theory (A) 14, 302-309 (1973)
30. Horst R.; Pardalos P.; Thoai N.: Introduction to Global Optimization. Kluwer, Dordrecht (1995)
31. Horst R.; Tuy H.: Global Optimization - Deterministic Approaches, 3rd edn. Springer, Berlin (1996)
32. Horst R.: On generalized bisection of n-simplices. Math. Comput. 218, 691-698 (1997)
33. Kaplan W.: A copositivity probe. Linear Algebra Appl. 337, 237-251 (2001)
34. Locatelli M.; Raber U.: On the convergence of the simplicial branch-and-bound algorithm based on ω-subdivisions. J. Optim. Theor. Appl. 107, 69-79 (2000)
35. Locatelli M.; Raber U.: A finiteness result for the simplicial branch-and bound algorithm based on ω-subdivisions. J. Optim. Theor. Appl. 107, 81-88 (2000)
36. Murty K.G.; Kabadi S.N.: Some NP-complete problems in quadratic and linear programming. Math. Program. 39, 117-129 (1987)
37. Parrilo P.A.: Semidefinite programming based test for matrix copositivity. Proc. 39th IEEE Conf. Decis. Control 5, 4624-4629 (2000)
38. Quist A.J.; de Klerk E.; Roos C.; Terlaky T.: Copositive relaxation for general quadratic programming. Optim. Methods Softw. 9, 185-209 (1998)
39. Tuy H.: Convex programs with an additional reverse convex constraint. J. Optim. Theor. Appl. 52, 463-486 (1987)
40. Väliaho H.: Criteria for copositive matrices. Linear Algebra Appl 81, 19-34 (1986)
41. Väliaho H.: Quadratic-programming criteria for copositive matrices. Linear Algebra Appl. 119, 163-182 (1989)
42. Yang S.; Li X.: Algorithms for determining the copositivity of a given symmetric matrix. Linear Algebra Appl. 430, 609-618 (2009)
43. Žilinskas J.; Dür M.: Depth-first simplicial partition for copositivity detection, with an application to Maxclique. Optim. Methods. Softw. 26, 499-510 (2011)