An efficient algorithm for range computation of polynomials using the Bernstein form

DOI10.1007/s10898-008-9382-yzbMath1191.90046OpenAlexW2092808221MaRDI QIDQ1037369

Shashwati Ray, Paluri S. V. Nataraj

Publication date: 16 November 2009

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-008-9382-y

zbMATH Keywords

global optimizationBernstein polynomialsinterval analysispolynomial optimizationrange computation

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items

Signomial and polynomial optimization via relative entropy and partial dualization ⋮ Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form ⋮ Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets ⋮ On stability of parametrized families of polynomials and matrices ⋮ Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach ⋮ A connected component labeling algorithm for implicitly defined domains ⋮ The Bernstein polynomial basis: a centennial retrospective ⋮ An improved Bernstein global optimization algorithm for MINLP problems with application in process industry ⋮ Matrix methods for the simplicial Bernstein representation and for the evaluation of multivariate polynomials ⋮ Matrix methods for the tensorial Bernstein form ⋮ A subdivision algorithm to reason on high-degree polynomial constraints over finite domains ⋮ Formalization of Bernstein polynomials and applications to global optimization

Uses Software

• SeDuMi
• GloptiPoly
• INTOPT_90
• Database of Polynomial Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust arithmetic for multivariate Bernstein-form polynomials
• A class of filled functions for finding global minimizers of a function of several variables
• On the numerical condition of polynomials in Bernstein form
• An approximate approach of global optimization for polynomial programming problems
• Handbook of global optimization
• Rigorous global search: continuous problems
• Lower bound functions for polynomials
• A hybrid algorithm for identifying global and local minima when optimizing functions with many minima.
• Nonlinear equations and optimization
• The globally convexized filled functions for global optimization
• Interval methods for global optimization
• An improved interval global optimization algorithm using higher-order inclusion function forms
• Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion
• GloptiPoly
• Semidefinite Approximations for Global Unconstrained Polynomial Optimization
• A new filled function method for global optimization