1. CMB 2003 (vol 46 pp. 575)
|Optimization of Polynomial Functions |
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.
Categories:14P10, 46L05, 90C22