Skip to main content
Log in

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

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

This paper is concerned with solving single CVaR and mixed CVaR minimization problems. A CHKS-type smoothing sample average approximation (SAA) method is proposed for solving these two problems, which retains the convexity and smoothness of the original problem and is easy to implement. For any fixed smoothing constant ε, this method produces a sequence whose cluster points are weak stationary points of the CVaR optimization problems with probability one. This framework of combining smoothing technique and SAA scheme can be extended to other smoothing functions as well. Practical numerical examples arising from logistics management are presented to show the usefulness of this method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Artstein, Z., Vitale, R.A.: A strong law of large numbers for random compact sets. Ann. Probab. 3, 879–882 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  2. Anderson, F., Mausser, H., Rosen, D., Uryasev, S.: Credit risk optimization with conditional Value-at-Risk criterion. Math. Program. 89, 273–291 (2001)

    Article  MathSciNet  Google Scholar 

  3. Artzner, P., Delbaen, F., Eber, J.M., Heath, D.: Coherent measures of risk. Math. Finance 9, 203–228 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bogentoft, E., Romeijn, H.E., Uryasev, S.: Asset/liability management for pension funds using CVaR constraints. J. Risk Finance 3, 57–71 (2001)

    Article  Google Scholar 

  5. Chen, X., Qi, L., Sun, D.: Global and superlinear convergence of the smoothing Newton’s method and its application to general box constrained variational inequalities. Math. Comput. 67, 519–540 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  6. Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, New York (1983)

    MATH  Google Scholar 

  7. Hurlimann, W.: Conditional Value-at-Risk bounds for compound Poisson risks and a normal approximation. J. Appl. Math. 3, 141–153 (2003)

    Article  MathSciNet  Google Scholar 

  8. Jorion, P.: Value at Risk: the New Benchmark for Controlling Market Risk. McGraw-Hill, New York (1997). McGraw-Hill International Edition, 2001

    Google Scholar 

  9. Krokhmal, P., Palmquist, J., Uryasev, S.: Portfolio optimization with conditional Value-at-Risk objective and constraints. J. Risk 4, 43–68 (2002)

    Google Scholar 

  10. Küzi-Bay, A., Mayer, J.: Computational aspects of minimizing conditional value-at-risk. Comput. Manag. Sci. 3, 3–27 (2006)

    Article  MathSciNet  Google Scholar 

  11. Lin, G., Chen, X., Fukushima, M.: Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization. Math. Program. 116, 343–368 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  12. Meng, F., Sun, J., Goh, M.: Stochastic optimization problems with CVaR risk measure and their sample average approximation. Working Paper, National University of Singapore (2009)

  13. Meng, F., Xu, H.: A regularized sample average approximation method for stochastic mathematical programs with nonsmooth equality constraints. SIAM J. Optim. 17, 891–919 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  14. Natarajan, K., Pachamanova, D., Sim, M.: Incorporating asymmetric distributional information in robust Value-at-Risk optimization. Manag. Sci. 54, 585 (2008)

    Article  Google Scholar 

  15. Qi, L., Sun, D., Zhou, G.: A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities. Math. Program. 87, 1–35 (2000)

    MathSciNet  MATH  Google Scholar 

  16. Qi, L., Sun, J.: A nonsmooth version of Newton’s method. Math. Program. 58, 353–367 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  17. Rockafellar, R.T.: Convex Analysis. Princeton University, Princeton (1970)

    MATH  Google Scholar 

  18. Rockafellar, R.T.: Coherent approaches to risk in optimization under uncertainty. Tutorials in Operations Research, INFORMS, pp. 38–61 (2007)

  19. Rockafellar, R.T., Uryasev, S.: Conditional Value-at-Risk for general loss distributions. J. Bank. Finance 26, 1443–1471 (2002)

    Article  Google Scholar 

  20. Rockafellar, R.T., Uryasev, S.: Optimization of conditional Value-at-Risk. J. Risk 2, 21–41 (2000)

    Google Scholar 

  21. Rubinstein, R.Y., Shapiro, A.: Discrete Event Systems: Sensitivity Analysis and Stochastic Optimization by the Score Function Method. Wiley, New York (1993)

    MATH  Google Scholar 

  22. Shapiro, A., Dentcheva, D., Ruszczyński, A.: Lectures on Stochastic Programming: Modeling and Theory. SIAM, Philadelphia (2009)

    Book  MATH  Google Scholar 

  23. Shapiro, A.: Stochastic programming by Monte Carlo simulation methods. Published electronically in: Stochastic Programming E-Print Series (2000)

  24. Shapiro, A.: Stochastic mathematical programs with equilibrium constraints. J. Optim. Theory Appl. 128, 223–243 (2006)

    Article  MathSciNet  Google Scholar 

  25. Xu, H., Meng, F.: Convergence analysis of sample average approximation methods for a class of stochastic mathematical programs with equality constraints. Math. Oper. Res. 32, 648–668 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  26. Yu, C.-S., Li, H.: A robust optimization model for stochastic logistic problems. Int. J. Prod. Econ. 64, 385–397 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fanwen Meng.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Meng, F., Sun, J. & Goh, M. A smoothing sample average approximation method for stochastic optimization problems with CVaR risk measure. Comput Optim Appl 50, 379–401 (2011). https://doi.org/10.1007/s10589-010-9328-4

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-010-9328-4

Keywords

Navigation