- Convergence analysis for Lasserre's measure--based hierarchy of upper bounds for polynomial optimization Etienne de Klerk (E.deKlerkuvt.nl) Monique Laurent (moniquecwi.nl) Zhao Sun (z.sunuvt.nl) Abstract: We consider the problem of minimizing a continuous function f over a compact set K. We analyze a hierarchy of upper bounds proposed by Lasserre in [SIAM J. Optim. 21(3) (2011), pp. 864-􀀀885], obtained by searching for an optimal probability density function h on K which is a sum of squares of polynomials, so that the expectation \int_{K}f(x)h(x)dx is minimized. We show that the rate of convergence is O(1/sqrt{r}), where 2r is the degree bound on the density function. This analysis applies to the case when f is Lipschitz continuous and K is a full-dimensional compact set satisfying some boundary condition (which is satis ed, e.g., for polytopes and the Euclidean ball). The rth upper bound in the hierarchy may be computed using semide nite programming if f is a polynomial of degree d, and if all moments of order up to 2r+d of the Lebesgue measure on K are known, which holds for example if K is a simplex, hypercube, or a Euclidean ball. Keywords: Polynomial optimization  Semide nite optimization  Lasserre hierarchy Category 1: Global Optimization (Theory ) Category 2: Linear, Cone and Semidefinite Programming (Semi-definite Programming ) Citation: Technical report, Tilburg University and CWI Amsterdam, November 2014. Download: [PDF]Entry Submitted: 11/25/2014Entry Accepted: 12/01/2014Entry Last Modified: 09/08/2015Modify/Update this entry Visitors Authors More about us Links Subscribe, Unsubscribe Digest Archive Search, Browse the Repository Submit Update Policies Coordinator's Board Classification Scheme Credits Give us feedback Optimization Journals, Sites, Societies Optimization Online is supported by the Mathematical Optmization Society.