IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v334y2024i1d10.1007_s10479-022-04994-9.html
   My bibliography  Save this article

Monte carlo within simulated annealing for integral constrained optimizations

Author

Listed:
  • Roberto Casarin

    (Ca’ Foscari University of Venice)

  • Bertrand B. Maillet

    (Aim Quant Research Center (Emlyon Business School)
    University of La Reunion)

  • Anthony Osuntuyi

    (Ca’ Foscari University of Venice)

Abstract

For years, Value-at-Risk and Expected Shortfall have been well established measures of market risk and the Basel Committee on Banking Supervision recommends their use when controlling risk. But their computations might be intractable if we do not rely on simplifying assumptions, in particular on distributions of returns. One of the difficulties is linked to the need for Integral Constrained Optimizations. In this article, two new stochastic optimization-based Simulated Annealing algorithms are proposed for addressing problems associated with the use of statistical methods that rely on extremizing a non-necessarily differentiable criterion function, therefore facing the problem of the computation of a non-analytically reducible integral constraint. We first provide an illustrative example when maximizing an integral constrained likelihood for the stress-strength reliability that confirms the effectiveness of the algorithms. Our results indicate no clear difference in convergence, but we favor the use of the problem approximation strategy styled algorithm as it is less expensive in terms of computing time. Second, we run a classical financial problem such as portfolio optimization, showing the potential of our proposed methods in financial applications.

Suggested Citation

  • Roberto Casarin & Bertrand B. Maillet & Anthony Osuntuyi, 2024. "Monte carlo within simulated annealing for integral constrained optimizations," Annals of Operations Research, Springer, vol. 334(1), pages 205-240, March.
  • Handle: RePEc:spr:annopr:v:334:y:2024:i:1:d:10.1007_s10479-022-04994-9
    DOI: 10.1007/s10479-022-04994-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-022-04994-9
    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/s10479-022-04994-9?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:annopr:v:334:y:2024:i:1:d:10.1007_s10479-022-04994-9. 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.