Options
Lower bound functions for polynomials
Publikationstyp
Journal Article
Date Issued
2003-06-05
Sprache
English
Institut
TORE-URI
Volume
157
Issue
1
Start Page
207
End Page
225
Citation
Journal of Computational and Applied Mathematics 1 (157): 207-225 (2003-08-01)
Publisher DOI
Scopus ID
Publisher
Elsevier
Relaxation techniques for solving nonlinear systems and global optimisation problems require bounding from below the nonconvexities that occur in the constraints or in the objective function by affine or convex functions. In this paper we consider such lower bound functions in the case of problems involving multivariate polynomials. They are constructed by using Bernstein expansion. An error bound exhibiting quadratic convergence in the univariate case and some numerical examples are given.
DDC Class
510: Mathematik
More Funding Information
The authors gratefully acknowledge support from the Ministry of Education and Research of the Federal Republic of Germany under Contract No. 1707001.