Linear Optimization of Polynomials and Rational Functions over Boxes
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.
Cite
@article{arxiv.1906.03472,
title = {Linear Optimization of Polynomials and Rational Functions over Boxes},
author = {Tareq Hamadneh and Hassan Al-Zoubi and Mohammad Al-Qudah and Amjed Zraiqat},
journal= {arXiv preprint arXiv:1906.03472},
year = {2019}
}
Comments
There are alot of mistakes I found in this version