Subperiodic Dubiner distance, norming meshes and trigonometric polynomial optimization
From MaRDI portal
Publication:1800451
DOI10.1007/s11590-018-1250-1zbMath1414.90332OpenAlexW2789328291MaRDI QIDQ1800451
Publication date: 23 October 2018
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11577/3281191
trigonometric polynomialspolynomial optimizationDubiner distancenorming meshessubintervals of the period
Related Items (4)
Quadrature-based polynomial optimization ⋮ Near G-optimal Tchakaloff designs ⋮ Markov inequalities, Dubiner distance, norming meshes and polynomial optimization on convex bodies ⋮ Near-optimal polynomial interpolation on spherical triangles
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal polynomial admissible meshes on some classes of compact subsets of \(\mathbb{R}^d\)
- Polynomial fitting and interpolation on circular sections
- A note on total degree polynomial optimization by Chebyshev grids
- On optimal polynomial meshes
- Uniform approximation by discrete least squares polynomials
- Pseudometrics, distances and multivariate polynomial inequalities
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey
- Some applications of a polynomial inequality to global optimization
- Polynomial approximation and quadrature on geographic rectangles
- Bernstein-type inequalities
- Bivariate polynomial interpolation on the square at new nodal sets
- The theory of multi-dimensional polynomial approximation
- Schwankung von Polynomen zwischen Gitterpunkten. (Oscillations of polynomials between lattice points)
- Trigonometric Gaussian quadrature on subintervals of the period
- Jacobi norming meshes
- Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
- Low cardinality admissible meshes on quadrangles, triangles and disks
- Norming meshes by Bernstein-like inequalities
This page was built for publication: Subperiodic Dubiner distance, norming meshes and trigonometric polynomial optimization