Markov inequalities, Dubiner distance, norming meshes and polynomial optimization on convex bodies

DOI10.1007/s11590-018-1377-0zbMath1434.90156OpenAlexW2906702498WikidataQ128648271 ScholiaQ128648271MaRDI QIDQ2329654

Marco Vianello, Federico Piazzon

Publication date: 18 October 2019

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11577/3289818

zbMATH Keywords

convex bodiesMarkov inequalitypolynomial optimizationDubiner distancenorming meshtangential Markov inequality

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Inequalities and extremum problems involving convexity in convex geometry (52A40) Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items

Quadrature-based polynomial optimization ⋮ Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube ⋮ A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis ⋮ Tchakaloff polynomial meshes ⋮ Near G-optimal Tchakaloff designs ⋮ Near-optimal polynomial interpolation on spherical triangles

Uses Software

• DLMF
• WAM

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
• Discrete weighted least-squares method for the Poisson and biharmonic problems on domains with smooth boundary
• A note on total degree polynomial optimization by Chebyshev grids
• Nearly optimal meshes in subanalytic sets
• On optimal polynomial meshes
• Über die affine Exzentrizität konvexer Körper
• 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
• Pluripotential numerics
• Bernstein-type inequalities
• Bivariate polynomial interpolation on the square at new nodal sets
• Subperiodic Dubiner distance, norming meshes and trigonometric polynomial optimization
• A Markov inequality in several dimensions
• Bounds of the affine breadth eccentricity of convex bodies via semi-infinite optimization
• The theory of multi-dimensional polynomial approximation
• The collocation solution of Poisson problems based on approximate Fekete points
• On the regularity of domains satisfying a uniform hour-glass condition and a sharp version of the Hopf-Oleinik boundary point principle
• On Blaschke's rolling theorems
• On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
• Small perturbations of polynomial meshes
• Suboptimal Polynomial Meshes on Planar Lipschitz Domains
• Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
• Shapes and Geometries
• A general Bieberbach inequality
• Tangential Markov inequalities on real algebraic varieties
• Bound-Constrained Polynomial Optimization Using Only Elementary Calculations
• Bernstein type inequalities on star-like domains in $${\mathbb{R }}^d$$ with application to norming sets