English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We study the convergence rate of a hierarchy of upper bounds for polynomialoptimization problems, proposed by Lasserre [SIAM J. Optim. 21(3) (2011), pp.864-885], and a related hierarchy by De Klerk, Hess and Laurent [SIAM J. Optim.27(1), (2017) pp. 347-367]. For polynomial optimization over the hypercube, weshow a refined convergence analysis for the first hierarchy. We also show lowerbounds on the convergence rate for both hierarchies on a class of examples.These lower bounds match the upper bounds and thus establish the true rate ofconvergence on these examples. Interestingly, these convergence rates aredetermined by the distribution of extremal zeroes of certain families oforthogonal polynomials.

Worst-case examples for Lasserre's measure--based hierarchy for polynomial optimization on the hypercube