IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-319-31484-6_12.html
   My bibliography  Save this book chapter

Polynomial Optimization

In: Convex Analysis and Global Optimization

Author

Listed:
  • Hoang Tuy

    (Institute of Mathematics)

Abstract

Polynomial optimization is concerned with optimization problems described by multivariate polynomials on ℝ + n . $$\mathbb{R}_{+}^{n}.$$ In this chapter two approaches are presented for polynomial optimization. In the first approach a polynomial optimization problem is solved as a nonconvex optimization problem by a rectangular branch and bound algorithm in which bounding is performed by linear or convex relaxation. In the second approach, by viewing any multivariate polynomial on ℝ + n $$\mathbb{R}_{+}^{n}$$ as a difference of two increasing functions, a polynomial optimization problem is treated as a monotonic optimization problem. In particular, the Successive Incumbent Transcending algorithm is developed which starts from a quickly found feasible solution then proceeds to gradually improving it to optimality.

Suggested Citation

  • Hoang Tuy, 2016. "Polynomial Optimization," Springer Optimization and Its Applications, in: Convex Analysis and Global Optimization, edition 2, chapter 0, pages 435-452, Springer.
  • Handle: RePEc:spr:spochp:978-3-319-31484-6_12
    DOI: 10.1007/978-3-319-31484-6_12
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:spochp:978-3-319-31484-6_12. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.