IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v332y2026i2p542-561.html

Distributionally robust optimal uncertainty quantification under Phi-divergence ambiguity

Author

Listed:
  • Nguyen, H.N.
  • Lejeune, M.A.

Abstract

We investigate distributionally robust optimal uncertainty quantification (DROUQ) problems under Phi-divergence ambiguity. The DROUQ model is a semi-infinite fractional distributionally robust optimization problem with an infinite number of adaptive chance constraints. The objective is to maximize the worst-case probability that a response function, expressed as the ratio of two stochastic functions, exceeds a given performance threshold. We propose a generic reformulation, which transforms the DROUQ problem – under any Phi-divergence – into a finite-dimensional nonconvex chance-constrained problem. Building on this result and focusing on the Variation and the Hellinger distance Phi-divergences, we further demonstrate that the DROUQ model can be reformulated as a biconvex continuous second-order cone problem for several types of nonlinear fractional response functions. We design a new monotonic alternative convex search algorithm that converges finitely and solves exactly the biconvex reformulations. We evaluate our approach on a financial problem in which the response function is the Sharpe ratio of a portfolio and the objective is to determine the investment strategy that maximizes the worst-case probability under which the Sharpe ratio reaches the required level. The tests attest that the algorithm is computationally efficient and that the solution time is invariant with the size of the nominal distribution. The out-of-sample tests show that the DROUQ models outperform the ambiguity-free one.

Suggested Citation

  • Nguyen, H.N. & Lejeune, M.A., 2026. "Distributionally robust optimal uncertainty quantification under Phi-divergence ambiguity," European Journal of Operational Research, Elsevier, vol. 332(2), pages 542-561.
  • Handle: RePEc:eee:ejores:v:332:y:2026:i:2:p:542-561
    DOI: 10.1016/j.ejor.2026.02.036
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221726002080
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2026.02.036?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:eee:ejores:v:332:y:2026:i:2:p:542-561. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.