A Comparison of Methods for the Computation of Affine Lower Bound Functions for Polynomials

DOI10.1007/11425076_6zbMath1132.90361OpenAlexW1560712205MaRDI QIDQ5450799

Jürgen Garloff, Andrew Paul Smith

Publication date: 14 March 2008

Published in: Global Optimization and Constraint Satisfaction (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11425076_6

zbMATH Keywords

complexityglobal optimizationBernstein polynomialsconvex hullcontrol pointsbound functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items

Fast construction of constant bound functions for sparse polynomials

Uses Software

• INTOPT_90

This page was built for publication: A Comparison of Methods for the Computation of Affine Lower Bound Functions for Polynomials