IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v3y2006i1p3-27.html
   My bibliography  Save this article

Computational aspects of minimizing conditional value-at-risk

Author

Listed:
  • Alexandra Künzi-Bay

    ()

  • János Mayer

Abstract

We consider optimization problems for minimizing conditional value-at-risk (CVaR) from a computational point of view, with an emphasis on financial applications. As a general solution approach, we suggest to reformulate these CVaR optimization problems as two-stage recourse problems of stochastic programming. Specializing the L-shaped method leads to a new algorithm for minimizing conditional value-at-risk. We implemented the algorithm as the solver CVaRMin. For illustrating the performance of this algorithm, we present some comparative computational results with two kinds of test problems. Firstly, we consider portfolio optimization problems with 5 random variables. Such problems involving conditional value at risk play an important role in financial risk management. Therefore, besides testing the performance of the proposed algorithm, we also present computational results of interest in finance. Secondly, with the explicit aim of testing algorithm performance, we also present comparative computational results with randomly generated test problems involving 50 random variables. In all our tests, the experimental solver, based on the new approach, outperformed by at least one order of magnitude all general-purpose solvers, with an accuracy of solution being in the same range as that with the LP solvers. Copyright Springer-Verlag Berlin/Heidelberg 2006

Suggested Citation

  • Alexandra Künzi-Bay & János Mayer, 2006. "Computational aspects of minimizing conditional value-at-risk," Computational Management Science, Springer, vol. 3(1), pages 3-27, January.
  • Handle: RePEc:spr:comgts:v:3:y:2006:i:1:p:3-27
    DOI: 10.1007/s10287-005-0042-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10287-005-0042-0
    Download Restriction: Access to full text is restricted to subscribers.

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Pu Huang & Dharmashankar Subramanian, 2012. "Iterative estimation maximization for stochastic linear programs with conditional value-at-risk constraints," Computational Management Science, Springer, vol. 9(4), pages 441-458, November.
    2. Csaba Fábián & Olga Papp & Krisztián Eretnek, 2013. "Implementing the simplex method as a cutting-plane method, with a view to regularization," Computational Optimization and Applications, Springer, vol. 56(2), pages 343-368, October.
    3. repec:spr:joptap:v:146:y:2010:i:2:d:10.1007_s10957-010-9676-3 is not listed on IDEAS
    4. Daniel Espinoza & Eduardo Moreno, 2014. "A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs," Computational Optimization and Applications, Springer, vol. 59(3), pages 617-638, December.
    5. Fábián, Csaba I., 2008. "Handling CVaR objectives and constraints in two-stage stochastic models," European Journal of Operational Research, Elsevier, vol. 191(3), pages 888-911, December.
    6. Mansini, Renata & Ogryczak, Wlodzimierz & Speranza, M. Grazia, 2014. "Twenty years of linear programming based portfolio optimization," European Journal of Operational Research, Elsevier, vol. 234(2), pages 518-535.
    7. Fanwen Meng & Jie Sun & Mark Goh, 2011. "A smoothing sample average approximation method for stochastic optimization problems with CVaR risk measure," Computational Optimization and Applications, Springer, vol. 50(2), pages 379-401, October.
    8. Roman, Diana & Mitra, Gautam & Zverovich, Victor, 2013. "Enhanced indexation based on second-order stochastic dominance," European Journal of Operational Research, Elsevier, vol. 228(1), pages 273-281.
    9. Kolos Ágoston, 2012. "CVaR minimization by the SRA algorithm," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 20(4), pages 623-632, December.
    10. Ling, Aifan & Sun, Jie & Xiu, Naihua & Yang, Xiaoguang, 2017. "Robust two-stage stochastic linear optimization with risk aversion," European Journal of Operational Research, Elsevier, vol. 256(1), pages 215-229.
    11. repec:spr:annopr:v:249:y:2017:i:1:d:10.1007_s10479-016-2279-0 is not listed on IDEAS
    12. Yuichi Takano & Keisuke Nanjo & Noriyoshi Sukegawa & Shinji Mizuno, 2015. "Cutting plane algorithms for mean-CVaR portfolio optimization with nonconvex transaction costs," Computational Management Science, Springer, vol. 12(2), pages 319-340, April.
    13. Włodzimierz Ogryczak & Tomasz Śliwiński, 2011. "On solving the dual for portfolio selection by optimizing Conditional Value at Risk," Computational Optimization and Applications, Springer, vol. 50(3), pages 591-595, December.
    14. Amir Ahmadi-Javid & Malihe Fallah-Tafti, 2017. "Portfolio Optimization with Entropic Value-at-Risk," Papers 1708.05713, arXiv.org.
    15. repec:eee:transb:v:108:y:2018:i:c:p:55-83 is not listed on IDEAS

    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:comgts:v:3:y:2006:i:1:p:3-27. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

    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 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.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.