Comparison of Lasserre's Measure-based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing

Research output: Working paperOther research output

22 Downloads (Pure)

Abstract

We consider the problem of minimizing a continuous function f over a compact set K. We compare the hierarchy of upper bounds proposed by Lasserre in [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 K a convex body, this comparison yields a faster rate of convergence of the Lasserre hierarchy than what was previously known in the literature.
Original languageEnglish
Place of PublicationIthaca
PublisherCornell University Library
Number of pages12
Publication statusPublished - Mar 2017

Publication series

NamearXiv
Volume1703.00744

Keywords

  • polynomial optimization
  • semidefinite optimization
  • Lasserre hierarchy
  • simulated annealing

Fingerprint Dive into the research topics of 'Comparison of Lasserre's Measure-based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing'. Together they form a unique fingerprint.

  • Cite this