Advanced Search
MyIDEAS: Login to save this article or follow this journal

Computational aspects of minimizing conditional value-at-risk


Author Info

  • Alexandra Künzi-Bay


  • János Mayer
Registered author(s):


    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

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL:
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Springer in its journal Computational Management Science.

    Volume (Year): 3 (2006)
    Issue (Month): 1 (01)
    Pages: 3-27

    as in new window
    Handle: RePEc:spr:comgts:v:3:y:2006:i:1:p:3-27

    Contact details of provider:
    Web page:

    Order Information:

    Related research

    Keywords: Conditional value-at-risk; Stochastic programming; Mathematical programming algorithms; Stochastic models; Finance; Portfolio optimization; Risk management;


    No references listed on IDEAS
    You can help add them by filling out this form.


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

    Cited by:
    1. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.


    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


    Access and download statistics


    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: (Guenther Eichhorn) or (Christopher F Baum).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 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.