Global Escape Strategies for Maximizing Quadratic Forms over a Simplex

Journal of Global Optimization

Volumn 11, Issue 3, 1997, Pages 325-338

  Bomze, Immanuel M ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

Block pivoting; Copositivity; Indefinite quadratic programming; Independent set; Maximum clique

Indexed keywords

EID: 0041858636     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008297330705     Document Type: Article

References (16)

1. Bomze, I.M. (1996), Block pivoting for detecting copositivity. Linear Algebra Appl. 248, 161-184.
2. Bomze, I.H. (1997), Evolution towards the maximum clique, J. Global Optim. 10, 143-164.
3. Bomze, I.H. and Danninger, G. (1993), A global optimization algorithm for concave quadratic programming, SIAM J. Optim. 3, 826-842.
4. Bomze, I.H., Pelillo, M., and Giacomini, R. (1997), Evolutionary approach to the maximum clique problem: empirical evidence on a larger scale. In: I.M. Bomze, T. Csendes, R. Horst, and P.M. Pardalos (eds.), Developments in Global Optimization, pp. 95-108. Kluwer, Dordrecht.
5. Bomze, I.H. and Stix, V. (1997), Genetical engineering via negative fitness: evolutionary dynamics for global optimization. I.S.O.C. Report TR 97-02, Univ. of Vienna.
6. Borwein, J.M. (1982), Necessary and sufficient conditions for quadratic minimality, Numer. Funct. Anal. Optimiz. 5, 127-140.
7. Contesse, L.B. (1980), Une caractérisation complète des minima locaux en programmation quadratique, Numer. Math. 34, 315-332.
8. Danninger, G. and Bomze, I.M. (1993), Using copositivity for global optimality criteria in concave quadratic programming problems, Math. Programming 62, 575-580.
9. Dhrymes, Ph.J. (1984), Mathematics for econometrics, 2nd ed., Springer, New York.
10. Gibbons, L.E., Hearn, D.W., and Pardalos, P.M. (1996). A continuous based heuristic for the maximum clique problem. In: D.S. Johnson and M.A. Trick (eds.), Clique, Graph Coloring, and Satisfiability: Second DIMACS Implementation Challenge, pp. 103-124. DIMACS Series Vol. 26, American Mathematical Society.
11. Horst, R., Pardalos, P.M., and Thoai, N.V. (1995), Introduction to Global Optimization, Kluwer, Dordrecht.
12. Murty, K.G., and Kabadi, S.N. (1987), Some NP-complete problems in quadratic and linear programming, Math. Programming 39, 117-129.
13. Pelillo, M. (1995), Relaxation labeling networks for the maximum clique problem. J. Artif. Neural Networks 2, 313-327.
14. Väliaho, H. (1988), Testing the definiteness of matrices on polyhedral cones, Linear Algebra Appl. 101, 135-165.
15. Väliaho, H. (1989), Quadratic-programming criteria for copositive matrices, Linear Algebra Appl. 119, 163-182.
16. Väliaho, H. (1992), Determining subspaces on which a matrix is nonnegative definite. Linear Algebra Appl. 168, 71-93.