Linear Optimization of Polynomials and Rational Functions over Boxes
From MaRDI portal
Publication:6320177
arXiv1906.03472MaRDI QIDQ6320177FDOQ6320177
Authors: Tareq Hamadneh, Hassan Al-Zoubi, Mohammad A. AlQudah, Amjed Zraiqat 
Publication date: 8 June 2019
Abstract: In this paper, we investigate the problem of finding tight linear lower bounding functions for multivariate polynomials over boxes. These functions are obtained by the expansion of polynomials into Bernstein form and using the linear least squares function. Convergence properties of the given polynomials to their lower bounds are shown with respect to raising the degree, width of the box and subdivision. Subsequently, we provide a new method for constructing an affine lower bounding function for a multivariate rational function based on the Bernstein control points, the convex hull of a non-positive polynomial and degree elevation. Numerical comparisons with the well known Bernstein constant lower bounding function are finally given.
This page was built for publication: Linear Optimization of Polynomials and Rational Functions over Boxes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6320177)
