IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v183y2019i1d10.1007_s10957-019-01544-5.html
   My bibliography  Save this article

Polynomial Optimization on Some Unbounded Closed Semi-algebraic Sets

Author

Listed:
  • Trang T. Du

    (University of Transport and Communications)

  • Toan M. Ho

    (VAST)

Abstract

The article presents a study on a class of polynomial optimization problems over (noncompact) semi-algebraic sets which, by making changes of variables via suitable monomial mappings, become polynomial optimization problems over compact semi-algebraic feasible sets. It is known that the polynomial optimization problems on semi-algebraic feasible sets are satisfactory when the feasible sets are compact. Furthermore, determining whether a polynomial is bounded on such a semi-algebraic set can be replaced by checking whether its support lies in a closed and convex cone corresponding to the semi-algebraic set.

Suggested Citation

  • Trang T. Du & Toan M. Ho, 2019. "Polynomial Optimization on Some Unbounded Closed Semi-algebraic Sets," Journal of Optimization Theory and Applications, Springer, vol. 183(1), pages 352-363, October.
  • Handle: RePEc:spr:joptap:v:183:y:2019:i:1:d:10.1007_s10957-019-01544-5
    DOI: 10.1007/s10957-019-01544-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-019-01544-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10957-019-01544-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. V. Jeyakumar & J. B. Lasserre & G. Li, 2014. "On Polynomial Optimization Over Non-compact Semi-algebraic Sets," Journal of Optimization Theory and Applications, Springer, vol. 163(3), pages 707-718, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Vaithilingam Jeyakumar & Guoyin Li, 2017. "Exact Conic Programming Relaxations for a Class of Convex Polynomial Cone Programs," Journal of Optimization Theory and Applications, Springer, vol. 172(1), pages 156-178, January.
    2. Sönke Behrends & Anita Schöbel, 2020. "Generating Valid Linear Inequalities for Nonlinear Programs via Sums of Squares," Journal of Optimization Theory and Applications, Springer, vol. 186(3), pages 911-935, September.
    3. T. D. Chuong & V. Jeyakumar, 2018. "Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers," Journal of Global Optimization, Springer, vol. 72(4), pages 655-678, December.
    4. T. D. Chuong & V. Jeyakumar, 2017. "Finding Robust Global Optimal Values of Bilevel Polynomial Programs with Uncertain Linear Constraints," Journal of Optimization Theory and Applications, Springer, vol. 173(2), pages 683-703, 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:spr:joptap:v:183:y:2019:i:1:d:10.1007_s10957-019-01544-5. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.