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
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.
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/}
}
Cité par Sources :