Copositive relaxation for general quadratic programming

Optimization Methods and Software

Volumn 9, Issue 1-3, 1998, Pages 185-208

  Quist, A J ^a   De Klerk, E ^a   Roos, C ^a   Terlaky, T ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Copositive matrices; Duality theory; Global optimization; Quadratic programming; Semi definite optimization; Shor relaxation

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA;

COPOSITIVE RELAXATION; QUADRATIC PROGRAMMING;

NONLINEAR PROGRAMMING;

EID: 0031674391     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556789808805692     Document Type: Article

References (33)

1. Bazaraa, M. S., Sherali, H. D. and Shetty, C. M. (1993). Nonlinear Programming. Theory and Algorithms, John Wiley and Sons.
2. Bellare, M. and Rogaway, P. (1995). The complexity of approximating a nonlinear program. Mathematical Programming, 69, 429-441.
3. Bomze, I. M. (1996). Block pivoting and shortcut strategies for detecting copositivity. Linear Algebra and its Applications, 248, 161-184.
4. Bomze, I. M. and Danninger, G. (1993). A global optimization algorithm for concave quadratic programming problems. Siam J. Optimization, 3(4), 826-842.
5. Bomze, I. M. and Danninger, G. (1994). A Finite Algorithm for Solving General Quadratic Problems Journal of Global Optimization, 4, 1-16.
6. Cottle, R. W., Habetler, G. J. and Lemke, C. E. (1970). On classes of copositive matrices. Linear Algebra and its Applications, 3, 279-294.
7. Cottle, R. W., Habetler, G. J. and Lemke, C. E. (1970). Quadratic forms semi-definite over convex cones. In H. W. Kuhn, editor, Proceedings of the Princeton Symposium on Mathematical Programming, pages 551-565.
8. Diananda, P. H. (1962). On non-negative forms in real variables some or all of which are non-negative. Proceedings of the Cambridge Philosophical Society, 58, 17-25.
9. Goemans, M. X. and Williamson, D. P. (1995). Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of Assoc. Comput. Mach., 42, 1115-1145.
10. Güler, O. (1997). Hyperbolic polynomials and interior point methods for convex programing. Mathematics of Operations Research, 22(2).
11. Hadeler, K. P. (1983). On copositive matrices. Linear Algebra and its Applications, 49, 79-89.
12. Hall, M. Jr. and Newman, M. (1963). Copositive and completely positive quadratic forms. Proceedings of the Cambridge Philosophical Society, 59, 329-339.
13. Jarre, F. (1996). Interior-point methods for classes of convex programs. In T. Terlaky, editor, Interior point methods of mathematical programming, Kluwer, Dordrecht, pages 255-296.
14. Lovász, L. and Schrijver, A. (1991). Cones of matrices and set-functions and 0-1 optimization. SIAM Journal on Optimization, 1, 166-190.
15. Martin, D. H. (1981). Finite criteria for conditional definiteness of quadratic forms. Linear Algebra and its Applications, 39, 9-21.
16. Martin, D. H. and Jacobson, D. H. (1981). Copositive matrices and definiteness of quadratic forms subject to homogeneous linear inequality constraints. Linear Algebra and its Applications, 35, 227-258.
17. Motzkin, T. S. (1967). Signs of minors. In O. Shisha, editor, Inequalities, Academic Press, pages 225-240.
18. Murty, K. G. (1987). Some NP-complete problems in quadratic and nonlinear programming. Mathematical Programming, 39, 117-129.
19. Nesterov, Yu. and Nemirovskii, A. S. (1994). Interior Point Polynomial Algorithms in Convex Programming. SIAM Studies in Applied Mathematics, SIAM, Philadelphia, 13.
20. Nesterov, Yu. (1997). Quality of semidefinite relaxation for nonconvex quadratic optimization. CORE Discussion paper 9719, Belgium.
21. Papadimitriou, C. H. and Steiglitz, K. (1982). Combinatorial Optimization. Prentice-Hall.
22. Poljak, S., Rendl, F. and Wolkowicz, H. (1995). A Recipe for Semidefinite Relaxation for (0,1)-Quadratic Programming. Journal of Global Optimization, 7(1), 51-73.
23. Ramana, M. V. (1993). An Algorithmic Analysis of Multiquadratic and Semidefinite Programming Problems. PhD thesis, The Johns Hopkins University, Baltimore.
24. Ramana, M. (1997). An exact duality theory for semidefinite programming and its complexity implications. Mathematical Programming, Series B, 77(2), 129-162.
25. Ramana, M. V. and Pardalos, P. M. (1996). Semidefinite programming. In T. Terlaky, editor, Interior point methods of mathematical programming, Kluwer, Dordrecht, The Netherlands, pages 369-398.
26. Shor, N. Z. (1987). Quadratic optimization problems. Soviet Journal of Computer and System Sciences, 25(6), 1-11.
27. Väliaho, H. (1986). Criteria for copositive matrices. Linear Algebra and its Applications, 81, 19-34.
28. Väliaho, H. (1988). Testing the definiteness of matrices on polyhedral cones. Linear Algebra and its Applications, 101, 135-165.
29. Väliaho, H. (1989). Quadratic-programming criteria for copositive matrices. Linear Algebra and its Applications, 119, 163-182.
30. Vandenberghe, L. and Boyd, S. (1996). Semidefinite programming. SIAM Review, 38, 49-95.
31. Wolkowicz, H. (1981). Optimization applied in matrix theory. Linear Algebra and its Applications, 40, 101-118.
32. Ye, Y. (1997). Approximating quadratic programming with bound constraints. Working paper, Dept. of Management Science, University of Iowa, Iowa City, USA.
33. Ye, Y. (1997). Approximating quadratic programming with quadratic constraints. Working paper, Dept. of Management Science, University of Iowa, Iowa City, USA.