Some applications of a polynomial inequality to global optimization

DOI10.1007/s10957-005-6400-9zbMath1211.90189OpenAlexW2032405130MaRDI QIDQ948639

C. P. Kwong, Jiangfeng Zhang

Publication date: 17 October 2008

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-005-6400-9

zbMATH Keywords

Lipschitz optimizationpolynomialsbranch-and-bound algorithmsEhlich-Zeller-Gärtel inequality

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items (4)

Quadrature-based polynomial optimization ⋮ A note on total degree polynomial optimization by Chebyshev grids ⋮ Subperiodic Dubiner distance, norming meshes and trigonometric polynomial optimization ⋮ Markov inequalities, Dubiner distance, norming meshes and polynomial optimization on convex bodies

Cites Work

• The globally convexized filled functions for global optimization
• Schwankung von Polynomen zwischen Gitterpunkten. (Oscillations of polynomials between lattice points)
• Branch and bound algorithm for computing the minimum stability degree of parameter‐dependent linear systems

This page was built for publication: Some applications of a polynomial inequality to global optimization