Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming

DOI10.1137/22M1494476zbMATH Open1519.90155arXiv2203.05892MaRDI QIDQ6155879FDOQ6155879

Authors: Felix Kirschner, E. de Klerk 

Publication date: 7 June 2023

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

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.

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

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

zbMATH Keywords

semidefinite programmingsymmetry reductionpolynomial kernel method

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• 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

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)