On cones of nonnegative quadratic functions

Mathematics of Operations Research

Volumn 28, Issue 2, 2003, Pages 246-267

  Sturm, Jos F ^a   Zhang, Shuzhong ^b  

^a TILBURG UNIVERSITY   (Netherlands)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Co positive cones; LMI; Matrix decomposition; Quadratic functions; S procedure; SDP

Indexed keywords

ALGORITHMS; FUNCTIONS; LINEAR SYSTEMS; NONLINEAR PROGRAMMING; OPTIMIZATION;

SEMIDEFINITE PROGRAMMING (SDP);

OPERATIONS RESEARCH;

EID: 0038386380     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.28.2.246.14485     Document Type: Article

References (25)

1. Barvinok, A. I. 1995. Problems of distance geometry and convex properties of quadratic maps. Discrete and Comput. Geometry 13 189-202.
2. Ben-Tal, A., A. S. Nemirovsky. 1998. Robust convex optimization. Math. Oper. Res. 23(4) 769-805.
3. Carathéodory, C. 1907. Über den Variabilitätsbereich der Koeffizienten von Potenzreihen, die gegebene Werte nicht annehmen. Mathematische Annalen 64 95-115.
4. de Klerk, E., D. V. Pasechnik. 2000. Approximating the stability number of a graph via copositive programming. Technical report, TU Delft, Faculty of Information Technology and Systems, Delft, The Netherlands.
5. Dines, L. L. 1941. On the mapping of quadratic forms. Bull. Amer. Math. Soc. 47 494-498.
6. El Ghaoui, L., H. Lebret. 1997. Robust solutions to least-squares problems with uncertain data. SIAM J. Matrix Anal. and Appl. 18(4) 1035-1064.
7. Fradkov, A. L., V. A. Yakubovich. 1979. The S-procedure and duality relations in nonconvex problems of quadratic programming. Leningrad, Russia, Vestnik Leningrad University, Vol. 6, 101-109. English translation; original Russian publication in Vestnik Leningradskogo Universiteta, Seriya Matematika, No. 1, 1973.
8. Fu, M., Z-Q. Luo, Y. Ye. 1998. Approximation algorithms for quadratic programming. J. Combin. Optim. 2(1) 29-50.
9. Hiriart-Urruty, J-B., M. Torki. 2001. Permanently going back and forth between the "quadratic world" and the "convexity world" in optimization. Technical report, Université Paul Sabatier, Toulouse Cedex, France.
10. Lasserre, J. B. 2001. Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3) 796-817.
11. Luo, Z-Q., J. F. Sturm. (2000). Error bounds for quadratic systems. J. B. G. Frenk, C. Roos, T. Terlaky, S. Zhang, eds. High Performance Optimization. Kluwer Academic Publishers, Dordrecht, The Netherlands, 383-404.
12. Murty, K. G., S. N. Kabadi. 1987. Some NP-complete problems in quadratic and nonlinear programming. Math. Programming 39 117-129.
13. Nesterov, Y. 2000. Squared functional systems and optimization problems. J. B. G. Frenk, C. Roos, T. Terlaky, S. Zhang, eds. High Performance Optimization. Kluwer Academic Publishers, Dordrecht, The Netherlands, 405-440.
14. _, A. Nemirovsky. 1994. Interior Point Polynomial Methods in Convex Programming, Vol. 13. Studies in Applied Mathematics. SIAM, Philadelphia, PA.
15. Parrilo, P. A. 2000. On a decomposition of multivariable forms via LMI methods. Technical report, California Institute of Technology, Pasadena, CA.
16. Pataki, G. 1998. On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigen-values. Math. Oper. Res. 23(2) 339-358.
17. Polyak, B. T. 2001. Convexity of nonlinear image of a small ball with applications to optimization. Set-Valued Analysis. Forthcoming.
18. Quist, A. J., E. de Klerk, C. Roos, T Terlaky. 1998. Copositive relaxation for general quadratic programming. Optim. Methods and Software 9 185-208. (Special Issue Celebrating the 60th Birthday of Professor Naum Shor.)
19. Rendl, F., H. Wolkowicz. 1997. A semidefinite framework for trust region subproblems with applications to large scale minimization. Math. Programming 77(2) 273-299.
20. Rockafellar, R. T. 1970. Convex Analysis. Princeton University Press, Princeton, NJ.
21. Sturm, J. F. 2000. Theory and algorithms for semidefinite programming. J. B. G. Frenk, C. Roos, T. Terlaky, S. Zhang, eds. High Performance Optimization. Kluwer Academic Publishers, Dordrecht, The Netherlands, 3-196.
22. Vavavis, S. A. 1991. Nonlinear Optimization: Complexity Issues. Oxford Science, New York.
23. Wolkowicz, H., R. Saigal, L. Vandenberghe, eds. 2001. Handbook on Semidefinite Programming. Kluwer Academic Publishers, Dordrecht, The Netherlands.
24. Yakubovich, V. A. 1977. S-procedure in nonlinear control theory. Vestnik Leningrad University, Vol. 4, No. 1, 73-93. English translation; original Russian publication in Vestnik Leningradskogo Universiteta, Seriya Matematika, Leningrad, Russia, 1971, 62-77.
25. Ye, Y. 1997. Interior Point Algorithms: Theory and Analysis. John Wiley & Sons, New York.