Geodesic
Optimization of Polynomial Functions
Canadian mathematical bulletin, Tome 46 (2003) no. 4, pp. 575-587

Voir la notice de l'article provenant de la source Cambridge University Press

This paper develops a refinement of Lasserre's algorithm for optimizing a polynomial on a basic closed semialgebraic set via semidefinite programming and addresses an open question concerning the duality gap. It is shown that, under certain natural stability assumptions, the problem of optimization on a basic closed set reduces to the compact case.
DOI : 10.4153/CMB-2003-054-7
Mots-clés : 14P10, 46L05, 90C22 
Marshall, M. Optimization of Polynomial Functions. Canadian mathematical bulletin, Tome 46 (2003) no. 4, pp. 575-587. doi: 10.4153/CMB-2003-054-7
@article{10_4153_CMB_2003_054_7,
     author = {Marshall, M.},
     title = {Optimization of {Polynomial} {Functions}},
     journal = {Canadian mathematical bulletin},
     pages = {575--587},
     year = {2003},
     volume = {46},
     number = {4},
     doi = {10.4153/CMB-2003-054-7},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-2003-054-7/}
}
TY  - JOUR
AU  - Marshall, M.
TI  - Optimization of Polynomial Functions
JO  - Canadian mathematical bulletin
PY  - 2003
SP  - 575
EP  - 587
VL  - 46
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-2003-054-7/
DO  - 10.4153/CMB-2003-054-7
ID  - 10_4153_CMB_2003_054_7
ER  - 
%0 Journal Article
%A Marshall, M.
%T Optimization of Polynomial Functions
%J Canadian mathematical bulletin
%D 2003
%P 575-587
%V 46
%N 4
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-2003-054-7/
%R 10.4153/CMB-2003-054-7
%F 10_4153_CMB_2003_054_7

[1] [1] Berg, C., Christensen, J. P. R. and Jenson, C. U., A remark on the multidimensional moment problem. Math. Ann. 243 (1979), 163–169. Google Scholar

[2] [2] Haviland, E. K., On the momentum problem for distribution functions in more than one dimension. Amer. J. Math. 57 (1935), 562–572. Google Scholar

[3] [3] Haviland, E. K., On the momentum problem for distribution functions in more than one dimension II. Amer. J. Math. 58 (1936), 164–168. Google Scholar

[4] [4] Jacobi, T., A representation theorem for certain partially ordered commutative rings. Math. Z. 23(2001). Google Scholar

[5] [5] Jacobi, T. and Prestel, A., Distinguished representations of strictly positive polynomials. J. Reine Angew.Math. 532 (2001), 223–235. Google Scholar

[6] [6] Kuhlmann, S. and Marshall, M., Positivity, sums of squares and the multidimensional moment problem. Trans. Amer.Math. Soc. 354 (2002), 4285–4301. Google Scholar

[7] [7] Lasserre, J. B., Optimization globale et théorie des moments. C. R. Acad. Sci. Paris Sér. I Math. 331 (2000), 929–934. Google Scholar

[8] [8] Lasserre, J. B., Global optimization with polynomials and the problem of moments. SIAM J. Optim. (3) 11(2000/01), 796–817 (electronic). Google Scholar

[9] [9] Marshall, M., Approximating positive polynomials using sums of squares. to appear. Google Scholar

[10] [10] Parrilo, P. A., Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. Ph.D. thesis, California Institute of Technology, May, 2000. Google Scholar

[11] [11] Parrilo, P. A. and Sturmfels, B., Minimizing polynomial functions. DIMACS Series in Discrete Math. Theor. Comput. Sci., to appear. Google Scholar

[12] [12] Powers, V. and Scheiderer, C., The moment problem for non-compact semialgebraic sets. Adv. in Geom. 1 (2001), 71–88. Google Scholar

[13] [13] Putinar, M., Positive polynomials on compact semialgebraic sets. Indiana Univ.Math. J. (3) 43 (1993), 969–984. Google Scholar

[14] [14] Schmüdgen, K., The K-moment problem for compact semialgebraic sets. Math. Ann. 289 (1991), 203–206. Google Scholar

[15] [15] Schmüdgen, K., On the moment problem of closed semi-algebraic sets. J. Reine Angew.Math. 558 (2003), 225–234. Google Scholar

[16] [16] Shor, N. Z., A class of global minimum bounds of polynomial functions. Cybernetics (6) 23 (1987), 731–734. Google Scholar

[17] [17] Shor, N. Z. and Stetsyuk, P. I., The use of a modification of the r-algorithm for finding the global minimum of polynomial functions. Cybernet. Systems Anal. 33 (1997), 482–497. Google Scholar

[18] [18] Wolkowicz, H., Saigal, R. and Vandenberghe, L. (eds), Handbook of Semidefinite programming. Kluwer, 2000. Google Scholar

Cité par Sources :