IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v92y2025i3d10.1007_s10898-025-01504-6.html
   My bibliography  Save this article

Distributionally Robust Optimization with Polynomial Robust Constraints

Author

Listed:
  • Jiawang Nie

    (University of California San Diego)

  • Suhan Zhong

    (Texas A&M University)

Abstract

This paper studies distributionally robust optimization (DRO) with polynomial robust constraints. We give a Moment-SOS relaxation approach to solve the DRO. This reduces to solving linear conic optimization with semidefinite constraints. When the DRO problem is SOS-convex, we show that it is equivalent to the linear conic relaxation and it can be solved by the Moment-SOS algorithm. For nonconvex cases, we also give concrete conditions such that the DRO can be solved globally. Numerical experiments are given to show the efficiency of the method.

Suggested Citation

  • Jiawang Nie & Suhan Zhong, 2025. "Distributionally Robust Optimization with Polynomial Robust Constraints," Journal of Global Optimization, Springer, vol. 92(3), pages 509-534, July.
  • Handle: RePEc:spr:jglopt:v:92:y:2025:i:3:d:10.1007_s10898-025-01504-6
    DOI: 10.1007/s10898-025-01504-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-025-01504-6
    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/s10898-025-01504-6?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.

    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:jglopt:v:92:y:2025:i:3:d:10.1007_s10898-025-01504-6. 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.