Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming

DOI10.1137/22M1494476MaRDI QIDQ6155879zbMATH OpenFDO

Authors Felix Kirschner, E. de Klerk

Publication date 7 June 2023

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2203.05892

zbMATH Keywords

semidefinite programmingsymmetry reductionpolynomial kernel method

Mathematics Subject Classification ID

Semidefinite programming (90C22) Algorithms for approximation of functions (65D15)

Abstract: In this paper we construct a hierarchy of multivariate polynomial approximation kernels via semidefinite programming. We give details on the implementation of the semidefinite programs defining the kernels. Finally, we show how a symmetry reduction may be performed to increase numerical tractability.

Recommendations

• Power series kernels
• Polynomial summaries of positive semidefinite kernels
• Polynomial Summaries of Positive Semidefinite Kernels
• On approximate approximations using Gaussian kernels
• Semidefinite Approximations for Global Unconstrained Polynomial Optimization

Cites work

• scientific article; zbMATH DE number 3301601 (Why is no real title available?)
• An effective version of Schmüdgen's Positivstellensatz for the hypercube
• Basc: constrained approximation by semidefinite programming
• CSDP, A C library for semidefinite programming
• Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
• Error bounds for some semidefinite programming approaches to polynomial minimization on the hypercube
• Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
• Global optimization with polynomials and the problem of moments
• Improved convergence rates for Lasserre-type hierarchies of upper bounds for box-constrained polynomial optimization
• Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software
• Korovkin-type approximation theory and its applications
• Multivariate polynomial approximation in the hypercube
• On the Gibbs Phenomenon and Its Resolution
• Positive trigonometric polynomials and signal processing applications
• Semi-algebraic approximation using Christoffel-Darboux kernel
• Semidefinite Programming
• Semidefinite optimization
• Symmetry groups, semidefinite programs, and sums of squares
• Symmetry in semidefinite programs
• TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
• The kernel polynomial method
• The moment-SOS hierarchy and the Christoffel-Darboux kernel

Cited in

(5)

• Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
• On symmetry adapted bases in trigonometric optimization
• Polynomial Summaries of Positive Semidefinite Kernels
• The link between 1-norm approximation and effective Positivstellensätze for the hypercube
• Optimization of trigonometric polynomials with crystallographic symmetry and spectral bounds for set avoiding graphs

This page was built for publication: Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155879)