LMI approximations for cones of positive semidefinite forms

SIAM Journal on Optimization

Volumn 16, Issue 4, 2006, Pages 1076-1091

  Zuluaga, Luis F ^a   Vera, Juan ^b   Peña, Javier ^c  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Conic programming; Global optimization; Linear matrix inequalities; Positive polynomials; Semidefinite programming

Indexed keywords

CONIC PROGRAMMING; LINEAR MATRIX INEQUALITIES; POSITIVE POLYNOMIALS; SEMIDEFINITE PROGRAMMING;

GLOBAL OPTIMIZATION; MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION; PROBLEM ORIENTED LANGUAGES; PROBLEM SOLVING;

MATHEMATICAL PROGRAMMING;

EID: 33750900187     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/03060151X     Document Type: Article

References (35)

1. D. BERTSIMAS AND I. POPESCU, Optimal inequalities in probability theory: A convex optimization approach, SIAM J. Optim., 15 (2005), pp. 780-804.
2. J. BOCHNAK. M. COSTE, AND M-F. ROY, Real Algebraic Geometry, Springer-Verlag, Berlin. 1998.
3. E. DE KLERK AND D. V. PASECHNIK, Approximation of the stability number of a graph via copositive programming, SIAM J. Optim., 12 (2002). pp. 875-892.
4. P. H. DIANANDA, On nonnegative forms in real variables some or all of which are nonnegative. Math. Proc. Cambridge Philos. Soc., 58 (1962), pp. 17-25.
5. G. GOLUB AND C. VAN LOAN, Matrix Computations. 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
6. D. HANDELMAN, Representing polynomials by positive linear functions on compact convex polyhedra, Pacific J. Math., 132 (1988), pp. 35-62.
7. B. HANZON AND D. JIBETEAN, Global minimization of a multivariate polynomial using matrix methods, J. Global Optim., 27 (2003). pp. 1-23.
8. G. HARDY, J. LITTLEWOOD, AND G. PÓLYA, Inequalities. 2nd ed.. Cambridge University Press, New York, 1988.
9. P. HILBERT, Uber die darstellung definiter formen als summe von formenquadraten, Math. Ann., 32 (1888), pp. 342-350.
10. D. HILBERT, Mathematical problems, Bull. Amer. Math. Soc., 8 (1902), pp. 437-479.
11. J. HIRIART-URRUTY AND C. LEMARÉCHAI,. Convex Analysis and Minimization Algorithms, Springer-Verlag, Berlin, 1993.
12. D. JIBETEAN, Algebraic Optimization with Applications to System Theory, Ph.D. thesis. Vrije Universiteit, Amsterdam. The Netherlands, 2003.
13. D. JIBETEAN AND E. DE KLERK, Global optimization of rational functions: A semidefinite programming approach, Math. Program., 106 (2006), pp. 93-109.
14. M. KOJIMA, S. KIM, AND H. WAKI, A general framework for convex relaxation of polynomial optimization problems over cones, J. Oper. Res. Soc. Japan, 46 (2003); pp. 125-144.
15. J. B. LASSERRE, Global optimization with polynomials and the problem of moments, SIAM J. Optim., 11 (2001), pp. 796-817.
16. J. B. LASSERRE, Bounds on measures satisfying moment conditions. Ami. Appl. Probab., 12 (2002), pp. 1114-1137.
17. M. LAURENT, A comparison of the Sherali Adams, Lova©sz Schrijver, and Lassrrre relaxations for 0-1 integer programming, Math. Oper. Res., 28 (2003), pp. 470-496.
18. M. LAURENT. Semidefinite representations for finite varieties. Math. Program, to appear.
19. Y. NESTEROV, Structure of Nonnegative Polynomials and Optimization Problems. Tech. report 9749, CORE, Louvain-la-Neuve, Belgium, 1997.
20. P. PARRILO, Structured Semidefinite Programs .and Semialgebraic Geometry Methods in Robustness and Optimization, Ph.D. thesis. Department of Control and Dynamical Systems, California Institute of Technology, Pasadena, CA, 2000.
21. P. PARRILO, Semidefinite programming relaxations for semialgebraic problems. Math. Program., 96 (2003), pp. 293-320.
22. I. POPESCU, A semidefinite programming approach to optimal moment bounds for convex classes of distributions, Math. Oper. Res., 30 (2005), pp. 632-657.
23. A. PRESTEL AND C. N. DELZELL, Positive Polynomials: From Hilbert's 17th problem to Real Algebra, Springer Monographs in Mathematics. Springer-Verlag, Berlin, 2001.
24. M. PUTINAR, Positive polynomials on compact sets. Indiana Univ. Math. J., 42 (1993), pp. 969-984.
25. J. RENEGAH, A Mathematical View of Interior-Point Methods in Convex Optimization. MPS/SIAM Ser. Optim. 3. SIAM, Philadelphia, 2001.
26. B. REZNICK, Uniform denominators in Hilbert's 17th problem. Math. Z., 220 (1995), pp. 75-97.
27. B. REZNICK, Some concrete aspects of Hilbert's 17th problem, in Real Algebraic Geometry and Ordered Structures, C. N. Delzell and J. J. Madden, eds., Contemp. Math. 253, AMS, Providence, RI, 2000. pp. 251-272.
28. T. ROCKAFELLAR. Convex Analysis, Princeton University Press. Princeton, NJ, 1970.
29. K. SCHMÜDGEN, The k-moment problem for compact semi-algebraic sets, Math. Ann., 289 (1991), pp. 203-206.
30. N. SHOR, Class of global minimum bounds of polynomial functions, Cybernetics, 23 (1987), pp. 731-734.
31. N. SHOR AND P. STETSYUK, The use of a modification of the r-algorithm for finding the global minimum of polynomial functions, Cybernet. Systems Anal., 33 (1997), pp. 482-497.
32. L. N. TREFETHEN AND D. BAU, Numerical Linear Algebra, SIAM, Philadelphia, 1997.
33. H. WOLKOWICZ, R. SAIGAL, AND L. VANDENBBRQHE, EDS., Handbook of Semidefinite Programming: Theory, Algorithms, and Applications, Kluwer Academic Publishers, Dordrecht, Boston, MA, 2000.
34. L. ZULUAGA AND J. PEÑA, A conic programming approach to generalized Tchebycheff inequalities, Math. Oper. Res., 30 (2005), pp. 369-388.
35. L. F. ZULUAGA, A Conic Programming Approach to Polynomial Optimization Problems: Theory and Applications, Ph.D. thesis, The Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA, 2004.