IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v50y2011i2p379-401.html
   My bibliography  Save this article

A smoothing sample average approximation method for stochastic optimization problems with CVaR risk measure

Author

Listed:
  • Fanwen Meng
  • Jie Sun
  • Mark Goh

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:coopap:v:50:y:2011:i:2:p:379-401
    DOI: 10.1007/s10589-010-9328-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-010-9328-4
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10589-010-9328-4?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.

    References listed on IDEAS

    as
    1. 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.
    2. Karthik Natarajan & Dessislava Pachamanova & Melvyn Sim, 2008. "Incorporating Asymmetric Distributional Information in Robust Value-at-Risk Optimization," Management Science, INFORMS, vol. 54(3), pages 573-585, March.
    3. Huifu Xu & Fanwen Meng, 2007. "Convergence Analysis of Sample Average Approximation Methods for a Class of Stochastic Mathematical Programs with Equality Constraints," Mathematics of Operations Research, INFORMS, vol. 32(3), pages 648-668, August.
    4. Philippe Artzner & Freddy Delbaen & Jean‐Marc Eber & David Heath, 1999. "Coherent Measures of Risk," Mathematical Finance, Wiley Blackwell, vol. 9(3), pages 203-228, July.
    5. Yu, Chian-Son & Li, Han-Lin, 2000. "A robust optimization model for stochastic logistic problems," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 385-397, March.
    6. Rockafellar, R. Tyrrell & Uryasev, Stanislav, 2002. "Conditional value-at-risk for general loss distributions," Journal of Banking & Finance, Elsevier, vol. 26(7), pages 1443-1471, July.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Zhang Qingye & Gao Yan, 2017. "An Asset Allocation Model and Its Solving Method," Journal of Systems Science and Information, De Gruyter, vol. 5(2), pages 163-175, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. F. W. Meng & J. Sun & M. Goh, 2010. "Stochastic Optimization Problems with CVaR Risk Measure and Their Sample Average Approximation," Journal of Optimization Theory and Applications, Springer, vol. 146(2), pages 399-418, August.
    2. 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.
    3. Vladimir Rankovic & Mikica Drenovak & Branko Uroševic & Ranko Jelic, 2016. "Mean Univariate-GARCH VaR Portfolio Optimization: Actual Portfolio Approach," CESifo Working Paper Series 5731, CESifo.
    4. Juan Ma & Foad Mahdavi Pajouh & Balabhaskar Balasundaram & Vladimir Boginski, 2016. "The Minimum Spanning k -Core Problem with Bounded CVaR Under Probabilistic Edge Failures," INFORMS Journal on Computing, INFORMS, vol. 28(2), pages 295-307, May.
    5. Ken Kobayashi & Yuichi Takano & Kazuhide Nakata, 2021. "Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization," Journal of Global Optimization, Springer, vol. 81(2), pages 493-528, October.
    6. Maria Scutellà & Raffaella Recchia, 2013. "Robust portfolio asset allocation and risk measures," Annals of Operations Research, Springer, vol. 204(1), pages 145-169, April.
    7. Wenqing Chen & Melvyn Sim, 2009. "Goal-Driven Optimization," Operations Research, INFORMS, vol. 57(2), pages 342-357, April.
    8. 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.
    9. Frank Fabozzi & Dashan Huang & Guofu Zhou, 2010. "Robust portfolios: contributions from operations research and finance," Annals of Operations Research, Springer, vol. 176(1), pages 191-220, April.
    10. Lwin, Khin T. & Qu, Rong & MacCarthy, Bart L., 2017. "Mean-VaR portfolio optimization: A nonparametric approach," European Journal of Operational Research, Elsevier, vol. 260(2), pages 751-766.
    11. Goh, Joel Weiqiang & Lim, Kian Guan & Sim, Melvyn & Zhang, Weina, 2012. "Portfolio value-at-risk optimization for asymmetrically distributed asset returns," European Journal of Operational Research, Elsevier, vol. 221(2), pages 397-406.
    12. Ahmadi-Javid, Amir & Fallah-Tafti, Malihe, 2019. "Portfolio optimization with entropic value-at-risk," European Journal of Operational Research, Elsevier, vol. 279(1), pages 225-241.
    13. Nasini, Stefano & Labbé, Martine & Brotcorne, Luce, 2022. "Multi-market portfolio optimization with conditional value at risk," European Journal of Operational Research, Elsevier, vol. 300(1), pages 350-365.
    14. 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.
    15. Amir Ahmadi-Javid & Malihe Fallah-Tafti, 2017. "Portfolio Optimization with Entropic Value-at-Risk," Papers 1708.05713, arXiv.org.
    16. Jang Ho Kim & Woo Chang Kim & Frank J. Fabozzi, 2014. "Recent Developments in Robust Portfolios with a Worst-Case Approach," Journal of Optimization Theory and Applications, Springer, vol. 161(1), pages 103-121, April.
    17. Berend Roorda, 2010. "An algorithm for sequential tail value at risk for path-independent payoffs in a binomial tree," Annals of Operations Research, Springer, vol. 181(1), pages 463-483, December.
    18. 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.
    19. 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.
    20. 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.

    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:coopap:v:50:y:2011:i:2:p:379-401. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc 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 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.