Block pivoting and shortcut strategies for detecting copositivity

Linear Algebra and Its Applications

Volumn 248, Issue , 1996, Pages 161-184

  Bomze, Immanuel M ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030486436     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/0024-3795(95)00165-4     Document Type: Article

References (26)

1. I. M. Bomze, Remarks on the recursive structure of copositivity, J. Inform. Optim. Sci. 8:243-260 (1987).
2. I. M. Bomze, Copositivity conditions for global optimality in indefinite quadratic programming problems, Czechoslovak J. Oper. Res. 1:7-19 (1992).
3. I. M. Bomze and G. Danninger, A global optimization algorithm for concave quadratic programming problems, SIAM J. Optim. 3:826-842 (1993).
4. I. M. Bomze and G. Danninger, A finite algorithm for solving general quadratic problems, J. Global Optim. 4:1-16 (1994).
5. E. Casas and C. Pola, An algorithm for indefinite quadratic programming based on a partial Cholesky factorization, Rech. Opér./Oper. Res. 27:401-426 (1993).
6. R. W. Cottle, Manifestations of the Schur complement, Linear Algebra Appl. 8:189-211 (1974).
7. R. W. Cottle, G. J. Habetler, and C. E. Lemke, On classes of copositive matrices, Linear Algebra Appl. 3:295-310 (1970).
8. G. Danninger, A recursive algorithm to detect (strict) copositivity of a symmetric matrix, in Methods of Operations Research No. 62 (U. Rieder, P. Gessner, A. Peyerimhoff, and F. J. Radermacher, Eds.), Hain, Meisenheim, 1990, pp. 45-52.
9. G. Danninger and I. M. Bomze, Using copositivity for global optimality criteria in concave quadratic programming problems, Math. Programming 62:575-580 (1993).
10. A. Forsgren, P. E. Gill, and W. Murray, Computing Modified Newton Directions Using a Partial Cholesky Factorization, Technical Report SOL-93-1, Dept. of Operations Research, Stanford Univ., 1993.
11. K. P. Hadeler, On copositive matrices, Linear Algebra Appl. 49:79-89 (1983).
12. E. L. Keller, The general quadratic optimization problem, Math. Programming 5:311-337 (1973).
13. M. Kostreva, Block pivot methods for solving the complementarity problem, Linear Algebra Appl. 21:207-215 (1978).
14. D. G. Luenberger, Linear and Nonlinear Programming, corrected reprint of 2nd ed., Addison-Wesley, Reading, Mass., 1989.
15. D. H. Martin and D. H. Jacobson, Copositive matrices and definiteness of quadratic forms subject to homogeneous linear inequality constraints, Linear Algebra Appl. 35:227-258 (1981).
16. K. G. Murty and S. N. Kabadi, Some NP-complete problems in quadratic and linear programming, Math. Programming 39:117-129 (1987).
17. C. van de Panne, Methods for Linear and Quadratic Programming, North-Holland, Amsterdam, 1975.
18. P. M. Pardalos and G. M. Schnitger, Checking local optimality in constrained quadratic problems is NP-hard, Oper. Res. Lett. 7:33-35 (1988).
19. F. J. Pereira, On Characterizations of Copositive Matrices. Ph.D. Thesis, Dept. of Operations Research, Stanford Univ., 1972.
20. G. Strang, Introduction to Applied Mathematics, Wellesley Cambridge Press, Wellesley, Pa., 1986.
21. G. Strang, A framework for equilibrium equations, SIAM Rev. 30:283-297 (1988).
22. H. Väliaho, Criteria for copositive matrices, Linear Algebra Appl. 81:19-34 (1986).
23. H. Väliaho, Testing the definiteness of matrices on polyhedral cones, Linear Algebra Appl. 101:135-165 (1988).
24. H. Väliaho, Quadratic-programming criteria for copositive matrices, Linear Algebra Appl. 119:163-182 (1989).
25. H. Väliaho, Determining subspaces on which a matrix is nonnegative definite, Linear Algebra Appl. 168:71-93 (1992).
26. Ch. Weninger, Kopositivität und Quadratische Optimierung, Ph.D. Thesis, Univ. Wien, 1993.