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

Research output: Contribution to journalArticleScientificpeer-review

Abstract

We study the convergence rate of a hierarchy of upper bounds for polynomial optimization 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, we show a refined convergence analysis for the first hierarchy. We also show lower bounds 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 of convergence on these examples. Interestingly, these convergence rates are determined by the distribution of extremal zeroes of certain families of orthogonal polynomials.
LanguageEnglish
JournalMathematics of Operations Research
StateAccepted/In press - 2018

Fingerprint

Hypercube
Polynomials
Polynomial
Optimization
Convergence Rate
Rate of Convergence
Lower bound
Upper bound
Convergence Analysis
Orthogonal Polynomials
Optimization Problem
Hierarchy
Zero
Rate of convergence
Lower bounds
Convergence rate

Cite this

@article{a939e3b3036142c9826307408ef8c306,
title = "Worst-case examples for Lasserre's measure-based hierarchy for polynomial optimization on the hypercube",
abstract = "We study the convergence rate of a hierarchy of upper bounds for polynomial optimization 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, we show a refined convergence analysis for the first hierarchy. We also show lower bounds 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 of convergence on these examples. Interestingly, these convergence rates are determined by the distribution of extremal zeroes of certain families of orthogonal polynomials.",
author = "{de Klerk}, Etienne and Monique Laurent",
year = "2018",
language = "English",
journal = "Mathematics of Operations Research",
issn = "0364-765X",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",

}

TY - JOUR

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

AU - de Klerk,Etienne

AU - Laurent,Monique

PY - 2018

Y1 - 2018

N2 - We study the convergence rate of a hierarchy of upper bounds for polynomial optimization 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, we show a refined convergence analysis for the first hierarchy. We also show lower bounds 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 of convergence on these examples. Interestingly, these convergence rates are determined by the distribution of extremal zeroes of certain families of orthogonal polynomials.

AB - We study the convergence rate of a hierarchy of upper bounds for polynomial optimization 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, we show a refined convergence analysis for the first hierarchy. We also show lower bounds 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 of convergence on these examples. Interestingly, these convergence rates are determined by the distribution of extremal zeroes of certain families of orthogonal polynomials.

M3 - Article

JO - Mathematics of Operations Research

T2 - Mathematics of Operations Research

JF - Mathematics of Operations Research

SN - 0364-765X

ER -