Quadrature-based polynomial optimization
From MaRDI portal
Publication:2191279
DOI10.1007/s11590-019-01416-xzbMath1445.90076OpenAlexW2921900064WikidataQ128258482 ScholiaQ128258482MaRDI QIDQ2191279
Marco Vianello, Alvise Sommariva, Federico Piazzon, Àngeles Martínez
Publication date: 24 June 2020
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-019-01416-x
Related Items (5)
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere ⋮ Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets ⋮ A new family of semi-implicit finite volume/virtual element methods for incompressible flows on unstructured meshes ⋮ Harmonic Hierarchies for Polynomial Optimization ⋮ A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
- Numerical integration of polynomials and discontinuous functions on irregular convex polygons and polyhedrons
- Minimal cubature rules and polynomial interpolation in two variables
- A note on total degree polynomial optimization by Chebyshev grids
- Bivariate Lagrange interpolation at the Padua points: the generating curve approach
- Extensions of Gauss quadrature via linear programming
- Some applications of a polynomial inequality to global optimization
- A numerical algorithm for the construction of efficient quadrature rules in two and higher dimensions
- Product Gauss cubature over polygons based on Green's integration formula
- Kubaturformeln mit minimaler Knotenzahl
- An encyclopaedia of cubature formulas.
- Subperiodic Dubiner distance, norming meshes and trigonometric polynomial optimization
- Generation and application of multivariate polynomial quadrature rules
- Distributionally robust optimization with polynomial densities: theory, models and algorithms
- Markov inequalities, Dubiner distance, norming meshes and polynomial optimization on convex bodies
- Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- Compression of Multivariate Discrete Measures and Applications
- A note on Tchakaloff’s Theorem
- Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube
- Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing
- Caratheodory-Tchakaloff Subsampling
- Bound-Constrained Polynomial Optimization Using Only Elementary Calculations
This page was built for publication: Quadrature-based polynomial optimization
