Some applications of a polynomial inequality to global optimization

DOI10.1007/S10957-005-6400-9zbMATH Open1211.90189OpenAlexW2032405130MaRDI QIDQ948639FDOQ948639

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

polynomialsLipschitz optimizationbranch-and-bound algorithms[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Ehlich-Zeller-G%EF%BF%BD%EF%BF%BDrtel+inequality&go=Go Ehlich-Zeller-G��rtel inequality]

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

• Global polynomial optimization by norming sets on sphere and torus
• Polynomial vector variational inequalities under polynomial constraints and applications
• Title not available (Why is that?)
• A note on total degree polynomial optimization by Chebyshev grids
• Markov inequalities, Dubiner distance, norming meshes and polynomial optimization on convex bodies
• Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
• Quadrature-based polynomial optimization
• Unconstrained and constrained global optimization of polynomial functions in one variable
• Subperiodic Dubiner distance, norming meshes and trigonometric polynomial optimization

   Recommendations

• Global optimality conditions and optimization methods for polynomial programming problems 👍 👎
• An approximate approach of global optimization for polynomial programming problems 👍 👎
• Global optimization with polynomials and the problem of moments 👍 👎
• Application of canonical duality theory to global optimization with polynomials 👍 👎
• Global optimality conditions and optimization methods for constrained polynomial programming problems 👍 👎
• Global optimization of polynomials restricted to a smooth variety using sums of squares 👍 👎
• Global optimization of polynomials using generalized critical values and sums of squares 👍 👎
• Global optimality conditions for some classes of polynomial integer programming problems 👍 👎
• Title not available (Why is that?) 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q948639)