Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Comparison of Lasserre's measure--based bounds for polynomial optimization to bounds obtained by simulated annealing (1703.00744v1)

Published 2 Mar 2017 in math.OC

Abstract: Comparison of Lasserre's measure--based bounds for polynomial optimization to bounds obtained by simulated annealing. We consider the problem of minimizing a continuous function $f$ over a compact set $\mathbf{K}$. We compare the hierarchy of upper bounds proposed by Lasserre in [{\em SIAM J. Optim.} $21(3)$ $(2011)$, pp. $864-885$] to bounds that may be obtained from simulated annealing. We show that, when $f$ is a polynomial and $\mathbf{K}$ a convex body, this comparison yields a faster rate of convergence of the Lasserre hierarchy than what was previously known in the literature.

Summary

We haven't generated a summary for this paper yet.