The Moment-SOS hierarchy and the Christoffel-Darboux kernel

11/17/2020
by   Jean-Bernard Lasserre, et al.
0

We consider the global minimization of a polynomial on a compact set B. We show that each step of the Moment-SOS hierarchy has a nice and simple interpretation that complements the usual one. Namely, it computes coefficients of a polynomial in an orthonormal basis of L 2 (B, μ) where μ is an arbitrary reference measure whose support is exactly B. The resulting polynomial is a certain density (with respect to μ) of some signed measure on B. When some relaxation is exact (which generically takes place) the coefficients of the optimal polynomial density are values of orthonormal polynomials at the global minimizer and the optimal (signed) density is simply related to the Christoffel-Darboux (CD) kernel and the Christoffel function associated with μ. In contrast to the hierarchy of upper bounds which computes positive densities, the global optimum can be achieved exactly as integration against a polynomial (signed) density because the CD-kernel is a reproducing kernel, and so can mimic a Dirac measure (as long as finitely many moments are concerned).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/06/2021

Hirschman-Widder densities

Hirschman and Widder introduced a class of Pólya frequency functions giv...
research
01/28/2021

Reproducing kernel Hilbert spaces, polynomials and the classical moment problems

We show that polynomials do not belong to the reproducing kernel Hilbert...
research
09/27/2017

On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity

In recent years, techniques based on convex optimization and real algebr...
research
09/13/2022

Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant

We consider polynomial optimization problems (POP) on a semialgebraic se...
research
03/26/2023

Convergence rates for sums-of-squares hierarchies with correlative sparsity

This work derives upper bounds on the convergence rate of the moment-sum...
research
05/19/2019

Optimal Guessing under Nonextensive Framework and associated Moment Bounds

We consider the problem of guessing the realization of a random variable...
research
01/02/2020

Stieltjes moment sequences for pattern-avoiding permutations

A small set of combinatorial sequences have coefficients that can be rep...

Please sign up or login with your details

Forgot password? Click here to reset