Set-semidefinite optimization

Journal of Convex Analysis

Volumn 15, Issue 4, 2008, Pages 767-801

  Eichfelder, Gabriele ^a   Jahn, Johannes ^a  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

Convex analysis; Copositive programming; Semidefinite programming; Vector optimization

Indexed keywords

EID: 59649110020     PISSN: 09446532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (53)

1. L.-F. Andersson, G. Chang, T. Elfving: Criteria for copositive matrices using simplices and barycentric coordinates, Linear Algebra Appl. 220 (1995) 9-30.
2. A. Berman, R. J. Plemmons: Nonnegative Matrices in the Mathematical Sciences, Academic Press, New York (1979).
3. E. Blum, W. Oettli: From optimization and variational inequalities to equilibrium problems, Math. Stud. 63 (1994) 123-145.
4. I. M. Bomze: Linear-time copositivity detection for tridiagonal matrices and extension to block-tridiagonality, SIAM J. Matrix Anal. Appl. 21 (2000) 840-848.
5. I. M. Bomze, E. de Klerk: Solving standard quadratic optimization problems via linear, semidefinite and copositive programming, J. Glob. Optim. 24 (2002) 163-185.
6. I. M. Bomze, M. Dür, E. de Klerk, C. Roos, A. J. Quist, T. Terlaky: On copositive programming and standard quadratic optimization problems, J. Glob. Optim. 18 (2000) 301-320.
7. I. M. Bomze, B. M. Pötscher: Game Theoretic Foundations of Evolutionary Stability, Springer, Berlin (1989).
8. J. M. Borwein: Necessary and sufficient conditions for quadratic minimality, Numer. Funct. Anal. Optimization 5 (1982) 127-140.
9. S. Bundfuss, M. Dür: Criteria for copositivity and approximations of the copositive cone, Preprint, Department of Mathematics, Darmstadt University of Technology, Darmstadt (2006).
10. S. Bundfuss, M. Dür: Algorithmic copositivity detection by simplicial partition, Linear Algebra Appl. 428 (2008) 1511-1523.
11. S. Burer: On the copositive representation of binary and continuous nonconvex quadratic programs, Working paper, Department of Management Sciences, University of Iowa, Iowa City (2007).
12. R. W. Cottle, G. J. Habetler, C. E. Lemke: On classes of copositive matrices, Linear Algebra Appl. 3 (1970) 295-310.
13. R. W. Cottle, G. J. Habetler, C. E. Lemke: Quadratic forms semi-definite over convex cones, in: Proc. Princeton Sympos. Math. Programming (Princeton, 1967), H. W. Kuhn (ed.), Princeton University Press, Princeton (1970) 551-565.
14. G. Danninger: Role of copositivity in optimality criteria for nonconvex optimization problems, J. Optimization Theory Appl. 75 (1992) 535-558.
15. G. Danninger, I. M. Bomze: Using copositivity for global optimality criteria in concave quadratic programming problems, Math. Program. 62 (1993) 575-580.
16. E. de Klerk, M. Laurent, P. Parrillo: On the equivalence of algebraic approaches to the minimization of forms on the simplex, in: Positive Polynomials in Control, D. Henrion, A. Garulli (eds.), Lecture Notes in Control and Information Sciences 312, Springer, Berlin (2005) 121-132.
17. E. de Klerk, D. V. Pasechnik: Approximation of the stability number of a graph via copositive programming, SIAM J. Optim. 12 (2002) 875-892.
18. M. Fukuda, M. Yamashita, M. Kojima: Computational prospects on copositive programming, RIMS Kokyuroku 1526 (2006) 207-213.
19. M. S. Gowda: A characterization of positive semidefinite operators on a Hubert space, J. Optimization Theory Appl. 48 (1986) 419-425.
20. M. S. Gowda: Complementarity problems over locally compact cones, SIAM J. Control Optimization 27 (1989) 836-841.
21. K. P. Hadeler: On copositive matrices, Linear Algebra Appl. 49 (1983) 79-89.
22. S.-P. Han, O. L. Mangasarian: A conjugate decomposition of the Euclidean space, Proc. Natl. Acad. Sci. USA 80 (1983) 5156-5157.
23. S.-P. Han, O. L. Mangasarian: Conjugate cone characterization of positive definite and semidefinite matrices, Linear Algebra Appl. 56 (1984) 89-103.
24. T. L. Hayden, J. Wells: Approximation by matrices positive semidefinite on a subspace, Linear Algebra Appl. 109 (1988) 115-130.
25. L. Hogben, C. R. Johnson, R. Reams: The copositive completion problem, Linear Algebra Appl. 408 (2005) 207-211.
26. K. D. Ikramov, N. V. Savel'eva: Conditionally definite matrices, J. Math. Sci., New York 98 (2000) 1-50.
27. J. Jahn: Vector Optimization. Theory, Applications, and Extensions, Springer, Berlin (2004).
28. J. Jahn: Introduction to the Theory of Nonlinear Optimization, 3rd Ed., Springer, Berlin (2007).
29. F. Jarre, J. Stoer: Optimierung, Springer, Berlin (2004).
30. W. Kaplan: A test for copositive matrices, Linear Algebra Appl. 313 (2000) 203-206.
31. W. Kaplan: A copositivity probe, Linear Algebra Appl. 337 (2001) 237-251.
32. H. Länger: Strictly copositive matrices and ESS's, Arch. Math. 55 (1990) 516-520.
33. R. Loewy, H. Schneider: Positive operators on the n-dimensional ice cream cone, J. Math. Anal. Appl. 49 (1975) 375-392.
34. K. Löwner: Über monotone Matrixfunktionen, Math. Z. 38 (1934) 177-216.
35. D. H. Martin: Conditional positivity of quadratic forms in Hilbert space, SIAM J. Math. Anal. 11 (1980) 1047-1057.
36. D. H. Martin: Finite criteria for conditional definiteness of quadratic forms, Linear Algebra Appl. 39 (1981) 9-21.
37. H. Maurer, J. Zowe: First and second-order necessary and sufficient optimality conditions for infinite-dimensional programming problems, Math. Program. 16 (1979) 98-110.
38. T. S. Motzkin: Copositive quadratic forms, National Bureau of Standards Report 1818 (1952) 11-22.
39. K. G. Murty, S. N. Kabadi: Some NP-complete problems in quadratic and linear programming, Math. Program. 39 (1987) 117-129.
40. P. A. Parrillo: Structured Semidefinite Programs and Semi-Algebraic Geometry Methods in Robustness and Optimization, PhD Thesis, California Institute of Technology, Pasadena (2000).
41. J. Povh: Application of Semidefinite and Copositive Programming in Combinatorial Optimization, PhD Thesis, Faculty of Mathematics and Physics, University of Ljubljana, Ljubljana (2006).
42. J. Povh, F. Rendl: Copositive and semidefinite relaxations of the quadratic assignment problem, Manuscript, Department of Mathematics, University of Klagenfurt (2006).
43. J. Povh, F. Rendl: A copositive programming approach to graph partitioning, SIAM J. Optim. 18 (2007) 223-241.
44. A. J. Quist, E. de Klerk, C. Roos, T. Terlaky: Copositive relaxation for general quadratic programming, Optim. Methods Softw. 9 (1998) 185-208.
45. Y. Sawaragi, H. Nakayama, T. Tanino: Theory of Multiobjective Optimization, Academic Press, London (1985).
46. H. C. Simpson, S. J. Spector: On copositive matrices and strong ellipticity for isotropic elastic materials, Arch. Ration. Mech. Anal. 84 (1983) 55-68.
47. J. F. Sturm, S. Zhang: On cones of nonnegative quadratic functions, Math. Oper. Res. 28 (2003) 246-267.
48. L. Vandenberghe, S. Boyd: Semidefinite programming, SIAM Rev. 38 (1996) 49-95.
49. H. Wolkowicz, R. Saigal, L. Vandenberghe (eds.): Handbook on Semidefinite Programming, Kluwer, Dordrecht (2000).
50. H. Väliaho: Criteria for copositive matrices, Linear Algebra Appl. 81 (1986) 19-34.
51. H. Väliaho: Testing the definiteness of matrices on polyhedral cones, Linear Algebra Appl. 101 (1988) 136-165.
52. H. Väliaho: Quadratic-programming criteria for copositive matrices, Linear Algebra Appl. 119 (1989) 163-182.
53. J. Werner: Optimization, Theory and Applications, Vieweg, Braunschweig (1984).