Global optimization of rational functions: A semidefinite programming approach

Mathematical Programming

Volumn 106, Issue 1, 2006, Pages 93-109

  Jibetean, D ^a   De Klerk, E ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b TILBURG UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; MATHEMATICAL PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING;

RATIONAL FUNCTIONS; SEMIDEFINITE PROGRAMMING (SDP);

GLOBAL OPTIMIZATION;

EID: 29144520191     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-005-0589-0     Document Type: Article

References (24)

1. de Klerk, E., Pasechnik, D. V.: Products of positive forms, linear matrix inequalities, and Hilbert 17-th problem for ternary forms. European J. of Operational Research, 157 (1), 39-45 (2004)
2. Drud, A.: CONOPT - a CRG code for large sparse dynamic nonlinear optimization problems. Mathematical Programming, 31, 153-191 (1985)
3. Hanzon, B., Jibetean, D.: Global minimization of a multivariate polynomial using matrix methods. Global Optimization, 27 (1), 1-23 (2003)
4. Henrion, D., Lasserre, J.: Gloptipoly: Global optimization over polynomials with Matlab and SeDuMi. ACM Transactions on Mathematical Software, 29 (2), 165-194, (2003)
5. Jibetean, D.: Global optimization of rational multivariate functions. Technical Report PNA-R0120, CWI, Amsterdam, 2001
6. Jibetean, D.: Algebraic optimization with applications to system theory. PhD thesis, Vrije Universiteit, Amsterdam, 2003. Available from http://www.math.vu.nl/research/theses/jibetean.php.
7. 2 optimal model reduction. In: Gilliam, D., Rosenthal, J. (eds), Proc. of the 15th International Symposium on MTNS, 2002
8. Kojima, M., Tunçel, L.: Cones of matrices and successive convex relaxations of nonconvex sets. SIAM J. Optimization, 10, 750-778 (2000)
9. Kojima, M., Tunçel, L.: Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization problems. Mathematical Programming. Series A, 89, 79-111 (2000)
10. Lam, T.: An introduction to real algebra. Rocky Mountain J. Math. 14 (4), 767-814 (1984)
11. Lassere, J.: Global optimization with polynomials and the problem of moments. SIAM J.Optim. 11 (3), 796-817 (2001)
12. Lasserre, J.: Global optimization with polynomials and the problem of moments. SIAM J. Optimization, 11, 296-817 (2001)
13. Nesterov, Y.: Squared functional systems and optimization problems. In: Frenk, H., Roos, K., Terlaky, T., Zhang, S. (eds), High performance optimization, pages 405-440. Kluwer Academic Publishers, 2000
14. Parillo, P.: Structured Semidefinite Programs and Semi-algebraic Geometry Methods in Robustness and Optimization. PhD thesis, California Institute of Technology, Pasadena, California, USA, 2000. Available from http://www.cds. caltech.edu/~pablo/.
15. Parrilo, P. A. : Semidefinite programming relaxations for semialgebraic problems. Mathematical Programming Ser. B, 96 (2), 293-320 (2003)
16. Parrilo, P. A., Sturmfels, B. : Minimizing polynomial functions. In: Algorithmic and quantitative real algebraic geometry, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, Vol. 60, 83-99 (2003)
17. Powers, V., Reznick, B.: Polynomials that are positive on an interval. Trans. Amer. Math. Soc. 352, 4677-4692 (2000)
18. Prajna, S., Papachristodoulou, A., Parrilo, P. A.: SOSTOOLS: Sum of squares optimization toolbox for MATLAB, 2004. Available from ttp://www.cds.caltec.edu/sostools
19. Putinar, M.: Positive polynomials on compact semi-algebraic sets. Ind. Univ. Math. J. 42, 969-984 (1993)
20. Reznick, B.: Uniform denominators in Hilbert's seventeenth problem. Math. Z. 220 (1), 75-97 (1995)
21. Reznick, B.: Some concrete aspects of Hilbert's 17th Problem. In: Real algebraic geometry and ordered structures (Baton Rouge, LA, 1996), pages 251-272. Amer. Math. Soc., Providence, RI, 2000
22. Schmüdgen, K.: The k-moment problem for compact semi-algebraic sets. Math. Ann. 2, 203-206 (1991)
23. Sturmfels, B.: Solving Systems of Polynomial Equations. Number 97 in CBMS Regional Conference Series in Mathematics. American Mathematical Society, 2002
24. Takeda, A., Dai, Y., Fukuda, M., Kojima, M.: Towards implementations of successive convex relaxation methods for nonconvex quadratic optimization problems. In: Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems, pages 489-510. Kluwer Academic Publishers, 2000