Dual optimal design and the Christoffel-Darboux polynomial

09/08/2020
by   Yohann De Castro, et al.
0

The purpose of this short note is to show that the Christoffel-Darboux polynomial, useful in approximation theory and data science, arises naturally when deriving the dual to the problem of semi-algebraic D-optimal experimental design in statistics. It uses only elementary notions of convex analysis.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/18/2020

A note on optimal designs for estimating the slope of a polynomial regression

In this note we consider the optimal design problem for estimating the s...
research
05/26/2022

A Simplified Treatment of Ramana's Exact Dual for Semidefinite Programming

In semidefinite programming the dual may fail to attain its optimal valu...
research
04/08/2019

Polynomial Invariant Theory and Shape Enumerator of Self-Dual Codes in the NRT-Metric

In this paper we consider self-dual NRT-codes, that is, self-dual codes ...
research
09/28/2020

Bezout-like polynomial equations associated with dual univariate interpolating subdivision schemes

The algebraic characterization of dual univariate interpolating subdivis...
research
05/27/2022

Optimal polynomial meshes exist on any multivariate convex domain

We show that optimal polynomial meshes exist for every convex body in ℝ^...
research
07/13/2021

Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields

Dual decomposition approaches in nonconvex optimization may suffer from ...
research
08/30/2016

Lopsided Approximation of Amoebas

The amoeba of a Laurent polynomial is the image of the corresponding hyp...

Please sign up or login with your details

Forgot password? Click here to reset