A comparison of methods for the computation of affine lower bound functions for polynomials

Authors:
Jürgen Garloff;Andrew P. Smith
Affiliations:
University of Applied Sciences / FH Konstanz, Konstanz, Germany;University of Applied Sciences / FH Konstanz, Konstanz, Germany
Venue:
COCOS'03 Proceedings of the Second international conference on Global Optimization and Constraint Satisfaction
Year:
2003

Citing 11
Cited 4

Convergent bounds for the range of multivariate polynomials

Proceedings of the International Symposium on interval mathematics on Interval mathematics 1985
New computer methods for global optimization

New computer methods for global optimization
Bezier and B-Spline Techniques

Bezier and B-Spline Techniques
Convexification and Global Optimization in Continuous And

Convexification and Global Optimization in Continuous And
Inclusion isotonicity of convex-concave extensions for polynomials based on Bernstein expansion

Computing
Lower bound functions for polynomials

Journal of Computational and Applied Mathematics
Rigorous Lower and Upper Bounds in Linear Programming

SIAM Journal on Optimization
Safe bounds in linear and mixed-integer linear programming

Mathematical Programming: Series A and B
Trilinear Monomials with Mixed Sign Domains: Facets of the Convex and Concave Envelopes

Journal of Global Optimization
Safe and tight linear estimators for global optimization

Mathematical Programming: Series A and B
Deterministic Global Optimization: Theory, Methods and (NONCONVEX OPTIMIZATION AND ITS APPLICATIONS Volume 37) (Nonconvex Optimization and Its Applications)

Deterministic Global Optimization: Theory, Methods and (NONCONVEX OPTIMIZATION AND ITS APPLICATIONS Volume 37) (Nonconvex Optimization and Its Applications)

Probabilistic evaluation of solutions in variability-driven optimization

Proceedings of the 2006 international symposium on Physical design
Fast construction of constant bound functions for sparse polynomials

Journal of Global Optimization
Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
An efficient algorithm for range computation of polynomials using the Bernstein form

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper the problem of finding an affine lower bound function for a multivariate polynomial is considered. For this task, a number of methods are presented, all based on the expansion of the given polynomial into Bernstein polynomials. Error bounds and numerical results for a series of randomly-generated polynomials are given.