Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming
From MaRDI portal
Publication:6155879
DOI10.1137/22m1494476zbMath1519.90155arXiv2203.05892MaRDI QIDQ6155879
Felix Kirschner, Etienne 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
Related Items
Cites Work
- Unnamed Item
- Symmetry in semidefinite programs
- Korovkin-type approximation theory and its applications
- Symmetry groups, semidefinite programs, and sums of squares
- The moment-SOS hierarchy and the Christoffel-Darboux kernel
- Semi-algebraic approximation using Christoffel-Darboux kernel
- An effective version of Schmüdgen's Positivstellensatz for the hypercube
- Global Optimization with Polynomials and the Problem of Moments
- Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization
- The kernel polynomial method
- Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube
- Semidefinite optimization
- On the Gibbs Phenomenon and Its Resolution
- CSDP, A C library for semidefinite programming
- Basc: constrained approximation by semidefinite programming
- Semidefinite Programming
- Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Multivariate polynomial approximation in the hypercube
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Positive trigonometric polynomials and signal processing applications
