IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i2p283-d322802.html
   My bibliography  Save this article

Linear Optimization of Polynomial Rational Functions: Applications for Positivity Analysis

Author

Listed:
  • Tareq Hamadneh

    (Department of Mathematics, Al Zaytoonah University of Jordan, Amman 11733, Jordan)

  • Mohammed Ali

    (Department of Mathematics and Statistics, Jordan University of Science and Technology, Irbid 22110, Jordan)

  • Hassan AL-Zoubi

    (Department of Basic Sciences, Al Zaytoonah University of Jordan, Amman 11733, Jordan)

Abstract

In this paper, we provide tight linear lower bounding functions for multivariate polynomials given over boxes. These functions are obtained by the expansion of polynomials into Bernstein basis and using the linear least squares function. Convergence properties for the absolute difference between the given polynomials and their lower bounds are shown with respect to raising the degree and the width of boxes and subdivision. Subsequently, we provide a new method for constructing an affine lower bounding function for a multivariate continuous rational function based on the Bernstein control points, the convex hull of a non-positive polynomial s , and degree elevation. Numerical comparisons with the well-known Bernstein constant lower bounding function are given. Finally, with these affine functions, the positivity of polynomials and rational functions can be certified by computing the Bernstein coefficients of their linear lower bounds.

Suggested Citation

  • Tareq Hamadneh & Mohammed Ali & Hassan AL-Zoubi, 2020. "Linear Optimization of Polynomial Rational Functions: Applications for Positivity Analysis," Mathematics, MDPI, vol. 8(2), pages 1-12, February.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:2:p:283-:d:322802
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/2/283/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/2/283/
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Muhammad Faisal Iqbal & Faizan Ahmed, 2022. "Approximation Hierarchies for the Copositive Tensor Cone and Their Application to the Polynomial Optimization over the Simplex," Mathematics, MDPI, vol. 10(10), pages 1-17, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:8:y:2020:i:2:p:283-:d:322802. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.