Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere

Research output: Contribution to journalArticleScientificpeer-review

1 Citation (Scopus)

Abstract

We study the convergence rate of a hierarchy of upper bounds for polynomial minimization problems, proposed by Lasserre (SIAM J Optim 21(3):864–885, 2011), for the special case when the feasible set is the unit (hyper)sphere. The upper bound at level r∈ N of the hierarchy is defined as the minimal expected value of the polynomial over all probability distributions on the sphere, when the probability density function is a sum-of-squares polynomial of degree at most 2r with respect to the surface measure. We show that the rate of convergence is O(1 / r 2) and we give a class of polynomials of any positive degree for which this rate is tight. In addition, we explore the implications for the related rate of convergence for the generalized problem of moments on the sphere.

Original languageEnglish
JournalMathematical Programming
DOIs
Publication statusE-pub ahead of print - Jan 2020

Keywords

  • polynomial optimization on sphere
  • Lasserre hierarchy
  • semidefinite programming
  • generalized eigenvalue problem

Fingerprint Dive into the research topics of 'Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere'. Together they form a unique fingerprint.

  • Cite this