A note on total degree polynomial optimization by Chebyshev grids
From MaRDI portal
Publication:683923
DOI10.1007/s11590-017-1166-1zbMath1411.90278OpenAlexW2725482609MaRDI QIDQ683923
Marco Vianello, Federico Piazzon
Publication date: 9 February 2018
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11577/3253917
Related Items (7)
Quadrature-based polynomial optimization ⋮ Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube ⋮ Harmonic Hierarchies for Polynomial Optimization ⋮ Subperiodic Dubiner distance, norming meshes and trigonometric polynomial optimization ⋮ Laplace Beltrami operator in the Baran metric and pluripotential equilibrium measure: the ball, the simplex, and the sphere ⋮ Near G-optimal Tchakaloff designs ⋮ Markov inequalities, Dubiner distance, norming meshes and polynomial optimization on convex bodies
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal polynomial admissible meshes on some classes of compact subsets of \(\mathbb{R}^d\)
- Hölder continuity of the Green function and Markov brothers' inequality
- On the convergence rate of grid search for polynomial optimization over the simplex
- 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
- The theory of multi-dimensional polynomial approximation
- Schwankung von Polynomen zwischen Gitterpunkten. (Oscillations of polynomials between lattice points)
- Small perturbations of polynomial meshes
- Suboptimal Polynomial Meshes on Planar Lipschitz Domains
- Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
- Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube
- Low cardinality admissible meshes on quadrangles, triangles and disks
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- Chebfun in Three Dimensions
- Bound-Constrained Polynomial Optimization Using Only Elementary Calculations
- An Extension of Chebfun to Two Dimensions
- An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution
This page was built for publication: A note on total degree polynomial optimization by Chebyshev grids
