Optimization of Polynomial Functions

Abstract

This paper develops a refinement of Lasserre's algorithm for optimizing a polynomial on a basic dosed semialgebraic set via semidefmite 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.