A variational approach to copositive matrices

SIAM Review

Volumn 52, Issue 4, 2010, Pages 593-629

  Hiriart Urruty, J B ^a   Seeger, A ^b  

^a INSTITUT DE MATHÉMATIQUES DE TOULOUSE   (France)

^b UNIVERSITY OF AVIGNON   (France)

Author keywords

Convex cone; Copositive matrix; Copositive programming; Copositivity test; Pareto eigenvalues; Quadratic programming

Indexed keywords

CONVEX CONE; COPOSITIVE; COPOSITIVE PROGRAMMING; COPOSITIVITY TEST; PARETO EIGENVALUES;

CONES; EIGENVALUES AND EIGENFUNCTIONS;

OPTIMIZATION;

EID: 79952938364     PISSN: 00361445     EISSN: None     Source Type: Journal    
DOI: 10.1137/090750391     Document Type: Article

References (104)

1. l.-e. andersson, G. Z. chang, and t. elfving, Criteria for copositive matrices using simplices and barycentric coordinates, Linear Algebra Appl., 220 (1995), pp. 9-30.
2. K. M. ANSTREicHER AND S. BuRER, DC versus copositive bounds for standard QP, J. Global Optim., 33 (2005), pp. 299-312.
3. D. AzÉ AND J.-B. HiRIART-URRUTY, Optimal Hoffman-type estimates in eigenvalue and semidefinite inequality constraints, J. Global Optim., 24 (2002), pp. 133-147.
4. p constraints, J. Convex Anal., 5 (1998), pp. 353-380.
5. G. P. BARKER Theory of convex cones, Linear Algebra Appl., 39 (1981), pp. 263-291.
6. V. J. D. BASTON, Extreme copositive quadratic forms, Acta Arith., 15 (1968/1969), pp. 319-327.
7. L. D. BAUMERT, Extreme copositive quadratic forms, Pac ific J. Math., 19 (1966), pp. 197-204.
8. L. D. BAUMERT Extreme copositive quadratic forms, II, Pacific J. Math., 20 (1967), pp. 1-20.
9. A. BERMAN AND R. J. PLEMMONS, Nonnegative Matrices in the Mathematical Sciences, revised reprint of the 1979 original, Classics Appl. Math. 9, SIAM, Philadelphia, PA, 1994.
10. A. BERMAN AND N. SHAKED-MONDERER Completely Positive Matrices, World Scientific, Singapore, 2003.
11. I. M. BOMZE, Remarks on the recursive structure of copositivity, J. Inform. Optim. Sci., 8 (1987), pp. 243-260.
12. I. M. BOMZE, Copositivity and optimization, Methods Oper. Res., 58 (1989), pp. 27-35.
13. I. M. BOMZE, Copositivity conditions for global optimality in indefinite quadratic programming problems, Czechoslovak J. Oper. Res., 1 (1992), pp. 7-19.
14. I. M. BOMZE, Block pivoting and shortcut strategies for detecting copositivity, Linear Algebra Appl., 248 (1996), pp. 161-184.
15. I. M. BOMZE, Linear-time copositivity detection for tridiagonal matrices and extension to block-tridiagonality, SIAM J. Matrix Anal. Appl., 21 (2000), pp. 840-848.
16. I. M. BOMZE, Regularity versus degeneracy in dynamics, games, and optimization: A unified approach to different aspects, SIAM Rev., 44 (2002), pp. 394-414.
17. I. M. BOMZE, Perron-Frobenius property of copositive matrices, and a block copositivity criterion, Linear Algebra Appl., 429 (2008), pp. 68-71.
18. 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 (2000), pp. 301-320.
19. I. M. BOMZE AND E. DE KLERK, Solving standard quadra tic optimization problems via linear, semidefinite and copositive programming, J. Global Optim., 24 (2002), pp. 163-185.
20. I. M. BOMZE AND L. PALAGI, Quartic formulation of standard quadratic optimization problems, J. Global Optim., 32 (2005), pp. 181-205. (Pubitemid 41367545)
21. S. BUNDFUSS, Copositive Matrices, Copositive Programming, and Applications, Ph.D. thesis, TU Darmstadt, 2009.
22. S. BUNDFUSS AND M. DÜR, Algorithmic copositivity detection by simplicial partition, Linear Algebra Appl., 428 (2008), pp. 1511-1523. (Pubitemid 351191953)
23. S. BURER, On the copositive representation of binary and continuous nonconvex quadratic programs, Math. Program., 120 (2009), pp. 479-495.
24. S. BURER, K. M. ANSTREICHER, AND M. DÜR, The difference between 5x5 doubly nonnegative and completely positive matrices, Linear Algebra Ap pl., 431 (2009), pp. 1539-1552.
25. G. CHANG AND T. W. SEDERBERG, Nonnegative quadratic Bézier triangular patches, Comput. Aided Geom. Design, 11 (1994), pp. 113-116.
26. L. CONTESSE, Une caractérisation complète des minima locaux en programmation quadratique, Numer. Math., 34 (1980), pp. 315-332.
27. R. W. COTTLE, Quartic barriers, Comput. Optim. Appl ., 12 (1999), pp. 81-105. (Pubitemid 129574926)
28. R. W. COTTLE, G. J. HABETLER, AND C. E. LEMKE, Quadratic forms semi-definite over convex cones, in Proceedings of the Princeton Symposium on Mathematical Programming, Princeton University Press, Princeton, NJ, 1970, pp 551-565.
29. R. W. COTTLE, G. J. HABETLER, AND C. E. LEMKE, On classes of copositive matrices, Linear Algebra Appl., 3 (1970), pp. 295-310.
30. J.-P. CROUZEIX, J.-E. MARTÍNEZ-LEGAZ, AND A. SEEGER, An alternative theorem for quadratic forms and extensions, Linear Algebra Appl., 215 (1995), pp. 121-134.
31. G. DANNINGER, A recursive algorithm for determining (strict) copositivity of a symmetric matrix, in Proceedings of the 14th Symposium on Operations Research (Ulm, 1989), Methods Oper. Res. 62, Hain, Frankfurt am Main, 1990, pp. 45-52.
32. G. DANNINGER, Role of copositivity in optimality criteria for nonconvex optimization problems, J. Optim. Theory Appl., 75 (1992), pp. 535-558. (Pubitemid 23599002)
33. G. DANNINGER AND I. M. BOMZE, Using copositivity for global optimality criteria in concave quadratic programming problems, Math. Programming, 62 (1993), pp. 575-580.
34. K. DERINKUYU AND M. C. PlNAR, On the S-procedure and some variants, Math. Methods Oper. Res., 64 (2006), pp. 55-77. (Pubitemid 44230404)
35. P. H. Diananda, On nonnegative forms in real variables some or all of which are nonnegative, Proc. Cambridge Philos. Soc., 58 (1962), p p. 17-25.
36. I. DukANovic AND F. Rendl, Copositive programming motivated bounds on the stability and the chromatic numbers, Math. Program., 121 (2009) , pp. 249-268.
37. M. DÜR AND G. Still, Interior points of the completely positive cone, Electron. J. Linear Algebra, 17 (2008), pp. 48-53.
38. G. EICHFELDER AND J. JAHN, Set-semidefinite optimization, J. Convex Anal., 15 (2008), pp. 767-801.
39. M. EPELMAN AND R. M. FREUND, A new condition measure, preconditioners, and relations between different measures of conditioning for conic linear systems, SIAM J.Optim., 12 (2002), pp. 627-655.
40. F. FACCHINEI AND J.-S. Pang, Finite-Dimensional Variational Inequalities and Complementarity Problems, Vol. I, Springer-Verlag, New York, 2003.
41. M. FIEDLER, Positivity with respect to the round cone, Mat. Časopis Sloven. Akad. Vied, 24 (1974), pp. 155-159.
42. R. M. FREUND, On the primal-dual geometry of level sets in linear and conic optimization, SIAM J. Optim., 13 (2003), pp. 1004-1013. (Pubitemid 37395683)
43. R. M. FREUND AND J. R. Vera, Condition-based complexity of convex optimization in conic linear form via the ellipsoid algorithm, SIAM J. Optim., 10 (1999), pp. 155-176.
44. J. W. GADDUM, Linear inequalities and quadratic forms, Pacific J. Math., 8 (1958), pp. 411-414.
45. D. GOELEVEN AND B. BROGLIATO, Stability and instability matrices for linear evolution variational inequalities, IEEE Trans. Automat. Control, 49 (2004), pp. 521-534.
46. D. GOURION AND A. SEEGER, Critical angles in polyhedral convex cones: Numerical and statistical considerations, Math. Program., 123 (2010), pp. 173-198.
47. D. GOURION AND A. SEEGER, Deterministic and random methods for computing volumetric moduli of convex cones, Comput. Appl. Math., 29 (2010), to appear.
48. K. P. HADELER, On copositive matrices, Linear Algebra Appl., 49 (1983), pp. 79-89.
49. M. HALL, Combinatorial Theory, Blaisdell, Boston, 1967.
50. M. HALL AND M. NEWMAN, Copositive and completely positive quadratic forms, Proc. Cambridge Philos. Soc., 59 (1963), pp. 329-339.
51. S. P. Han AND O. L. MANGASARIAN, Conjugate cone characterization of positive definite and semidefinite matrices, Linear Algebra Appl., 56 (1984), pp. 89-103.
52. E. HAYNSWORTH AND A. J. HOFFMAN, Two remarks on copositive matrices, Linear Algebra Appl., 2 (1969), pp. 387-392.
53. J.-B. HIRIART-URRUTY AND C. LemarÉchal, Convex Analysis and Minimization Algorithms, Vol. I, Springer-Verlag, Berlin, 1993.
54. J.-B. HIRIART-URRUTY AND C. LemarÉchal, Convex Analysis and Minimization Algorithms, Vol. II, Springer-Verlag, Berlin, 1993.
55. A. J. HOFFMAN AND F. PEREIRA, On copositive matrices with-1, 0, 1 entries, J.Combin. Theory Ser. A., 14 (1973), pp. 302-309.
56. R. A. HORN AND C. R. JOHNSON, Matrix Analysis, Cambridge University Press, Cambridge, UK, 1985.
57. K. D. IKRAMOV, An algorithm, linear with respect to time, for verifying the copositivity of an acyclic matrix, Comput. Math. Math. Phys., 42 (2002), pp. 1701-1703. (Pubitemid 36137070)
58. K. D. IKRAMOV AND N. V. SAVEL'EVA Conditionally definite matrices, J. Math. Sci., 98 (2000), pp. 1-50.
59. A. IUSEM AND A. SEEGER, Axiomatization of the index of pointedness for closed convex cones, Comput. Appl. Math., 24 (2005), pp. 245-283.
60. A. IUSEM AND A. SEEGER, On pairs of vectors achieving the maximal angle of a convex cone, Math. Program., 104 (2005), pp. 501-523. (Pubitemid 41521386)
61. A. IUSEM AND A. SEEGER, Measuring the degree of pointedness of a closed convex cone: A metric approach, Math. Nachr., 279 (2006), pp. 599-618. (Pubitemid 43535584)
62. A. IUSEM AND A. SEEGER, Angular analysis of two classes of non-polyhedral convex cones: The point of view of optimization theory, Comput. Appl. Math., 26 (2007), pp. 191-214.
63. A. IUSEM AND A. SEEGER, On convex cones with infinitely many critical angles, Optimization, 56 (2007), pp. 115-128.
64. A. IUSEM AND A. SEEGER, Normality and modulability indices. Part I: Convex cones in normed spaces, J. Math. Anal. Appl., 338 (2008), pp . 365-391.
65. A. IUSEM AND A. SEEGER, Searching for critical angles in a convex cone, Math. Program., 120 (2009), pp. 3-25.
66. D. H. JACOBSON, A generalization of Finsler's theorem for quadratic inequalities and equalities, Quaestiones Math., 1 (1976), pp. 19-28.
67. D. H. JACOBSON, Extensions of Linear-Quadratic Control, Optimization and Matrix Theory, Academic Press, London, 1977.
68. C. R. JOHNSON AND R. REAMS, Spectral theory of coposi tive matrices, Linear Algebra Appl., 395 (2005), pp. 275-281.
69. C. R. JOHNSON AND R. REAMS, Constructing copositive matrices from interior matrices, Electron. J. Linear Algebra, 17 (2008), pp. 9-20.
70. P. C. JONES, A note on the Talman, Van der Heyden linear complementarity algorithm, Math. Programming, 25 (1983), pp. 122-124.
71. J. J. JÚDICE, M. RAYDAN, S. S. ROSA, AND A. A. SANTOS, On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm, Numer. Algorithms, 47 (2008), pp. 391-407.
72. J. J. JÚDICE, H. D. SHERALI, AND I. M. RIBEIRO, The eigenvalue complementarity problem, Comput. Optim. Appl., 37 (2007), pp. 139-156. (Pubitemid 46709792)
73. S. N. KABADI AND K. G. M RTY, Some NP-complete problems in quadratic and nonlinear programming, Math. Programming, 39 (1987), pp. 117-129.
74. W. KAPLAN, A test for copositive matrices, Linear Algebra Appl., 313 (2000), pp. 203-206.
75. W. KAPLAN, A copositive probe, Linear Algebra Appl., 337 (2001), pp. 237-251.
76. E. DE KLERK AND D. V. PASECHNIK, Approximation of the stability number of a graph via copositive programming, SIAM J. Optim., 12 (2002), pp. 875-892.
77. E. DE KLERK AND D. V. PASECHNIK, A linear program ming reformulation of the standard quadratic optimization problem, J. Global Optim., 37 (2007), pp. 75-84. (Pubitemid 44876768)
78. Y. KwON, On Hadamard stability for compressible viscoelastic constitutive equations, J. Non-Newtonian Fluid Mech., 65 (1996), pp. 151-163. (Pubitemid 126394849)
79. J. B. LASSERRE, Global optimization with polynomials and the problem of moments, SIAM J. Optim., 11 (2001), pp. 796-817.
80. P. LI AND Y. Y. Feng, Criteria for copositive matrices of order four, Linear Algebra Appl., 194 (1993), pp. 109-124.
81. R. LOEWY AND H. SCHNEIDER, Positive operators on the n-dimensional ice cream cone, J. Math. Anal. Appl., 49 (1975), pp. 375-392.
82. D. H. MARTIN, Finite criteria for conditional definiteness of quadratic forms, Linear Algebra Appl., 39 (1981), pp. 9-21.
83. D. H. MARTIN AND D. H. JACOBSON, Copositive matrices and definiteness of quadratic forms subject to homogeneous linear inequality constraints, Linear Algebra Appl., 35 (1981), pp. 227-258.
84. C. A. MICCHELLI AND A. PINK S, Some remarks on nonnegative polynomials on polyhedra, in Probability, Statistics, and Mathematics (papers in honor of S. Karlin), Academic Press, Boston, 1989, pp. 163-186.
85. J.-J. MOREAU, Décomposition orthogonale d'un espace hilbertien selon deux cônes mutuellement polaires, C. R. Acad. Sci. Paris, 255 (1962), pp . 238-240.
86. T. S. MOTZKIN, Copositive quadratic forms, National Bureau of Standards Report, 1818 (1952), pp. 11-12.
87. T. S. MOTZKIN, Signs of minors, in Inequalities, O. Sh isa, ed., Academic Press, New York, 1967, pp. 225-240.
88. K. G. MURTY, Linear Complementarity, Linear and Nonlinear Programming, Helderman, Berlin, 1998.
89. E. NADLER, Nonnegativity of bivariate quadratic functions on a triangle, Comput. Aided Geom. Design, 9 (1992), pp. 195-205.
90. P. A. PARRILO, Semidefinite programming based tests for matrix copositivity, in Proceedings of the 39th IEEE Conference on Decision and Contr ol, Sydney, 2000, pp. 4624-4629. (Pubitemid 32528006)
91. A. PINTO DA COSTA AND A. SEEGER, Cone-constrained eigenvalue problems: Theory and algorithms, Comput. Optim. Appl., 45 (2010), pp. 25-57.
92. A. PINTO DA COSTA AND A. SEEGER, Numerical resolu tion of cone-constrained eigenvalue problems, Comput. Appl. Math., 28 (2009), pp. 37-61.
93. J. POVH AND F. RENDL, A copositive programming approach to graph partitioning, S\AMJ. Optim., 18 (2007), pp. 223-241. (Pubitemid 351271329)
94. I. PÓLIK AND T. TERLAKY, A survey of the S-lemma, SIAM Rev., 49 (2007), pp. 371-418. (Pubitemid 47377690)
95. m. queiroz, j. júdice, and c. humes, The symmetric eigenvalue complementarity problem, Math. Comp., 73 (2004), pp. 1849-1863. (Pubitemid 39374841)
96. a. j. quist, e. De klerk, c. roos, and t. terlaky, Copositive relaxation for general quadratic programming, Optim. Methods Softw., 9 ( 1998), pp. 185-208. (Pubitemid 128542196)
97. a. seeger, Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions, Linear Algebra Appl., 292 (1999), pp. 1-14. (Pubitemid 129563051)
98. a. seeger and m. torki, On eigenvalues induced by a cone-constraint, Linear Algebra Appl., 372 (2003), pp. 181-206.
99. a. seeger and m. torki, Local minima of quadratic forms on convex cones, J. Global Optim., 44, (2009), pp. 1-28.
100. h. c. simpson and s. j. spector, On copositive matrices and strong ellipticity for isotropic elastic materials, Arch. Rational Mech. Anal., 84 (1983), pp. 55-68. (Pubitemid 14504026)
101. h. väliaho, Criteria for copositive matrices, Linear Algebra Appl., 81 (1986), pp. 19-34.
102. h. väliaho, Testing the definiteness of matrices on polyhedral cones, Linear Algebra Appl., 101 (1988), pp. 135-165.
103. v. a. yakubovich, S-Procedure in nonlinear control theory, Vestnik Leningrad. Univ., 1 (1971), pp. 62-77.
104. y. yuan, On a subproblem of trust region algorithms for constrained optimization, Math. Programming, 47 (1990), pp. 53-63.