[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

DC programming and DCA for globally solving the value-at-risk

  • Original Paper
  • Published:
Computational Management Science Aims and scope Submit manuscript

Abstract

The value-at-risk is an important risk measure that has been used extensively in recent years in portfolio selection and in risk analysis. This problem, with its known bilevel linear program, is reformulated as a polyhedral DC program with the help of exact penalty techniques in DC programming and solved by DCA. To check globality of computed solutions, a global method combining the local algorithm DCA with a well adapted branch-and-bound algorithm is investigated. An illustrative example and numerical simulations are reported, which show the robustness, the globality and the efficiency of DCA.

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

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Andersson F, Mausser H, Rosen D, Uryasev S (2001) Credit risk optimization with conditional value-at-risk criterion. Math Programm Ser B 89: 273–291

    Article  Google Scholar 

  • Gilli M, Kellezi A (2002) A global optimization heuristic for portfolio choice with VaR and expected shortfall. In: Kontoghiorghes EJ, Rustem B, Siokos S (eds) Computational Methods in Decision-making, Economics and Finance. Applied Optimization Series. Kluwer Academic Publishers, Dordrecht, pp 167–183

  • Hiriart-Urruty JB, Lemarechal C (1991) Convex analysis and minimization algorithms. Parts I&II. Springer, Heidelberg

    Google Scholar 

  • Le Thi HA, Pham Dinh T (1997) Solving a class of linearly constrained indefinite quadratic problems by DC algorithms. J Glob Optim 11: 253–285

    Article  Google Scholar 

  • Le Thi HA, Pham Dinh T, Muu LD (1999) Exact penalty in DC programming. Vietnam J Math 27(2): 169–178

    Google Scholar 

  • Hoang T (1995) DC optimization: theory, methods and algorithms. In: Horst R, Pardalos PM(eds) Handbook of global optimization. Kluwer, Dordecht

    Google Scholar 

  • Hoang T (1998) Convex analysis and global optimization. Kluwer, Dordrecht

    Google Scholar 

  • Horst R, Van Thoai N (1999) DC programming: overview. J Optim Theory Appl 103: 1–43

    Article  Google Scholar 

  • Horst R, Pardalos PM, Van Thoai N (1996) Global optimization: deterministic approaches. Kluwer, Dordrecht

    Google Scholar 

  • Le Thi HA, Pham Dinh T (2002) DC Programming: theory, algorithms and applications. The State of the Art. A. (ed) The first international workshop on global constrained optimization and constraint satisbfaction (Cocos’ 02), Valbonne-Sophia Antipolis, France, October 2–4, 28 pp

  • Le Thi HA, Pham Dinh T (2003) Large scale molecular optimization from distances matrices by a DC optimization approach. SIAM J Optim 14(1): 77–116

    Article  Google Scholar 

  • Le Thi HA, Pham Dinh T (2004) DC programming approaches and DCA for globally solving linear complematarity problems. Research report. National Institute for Applied Sciences, Rouen (submitted)

  • Le Thi HA, Pham Dinh T (2005) The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problem. Ann Oper Res 133: 23–46

    Article  Google Scholar 

  • Le Thi HA, Pham Dinh T, Ngai HV (2005) Exact penalty techniques in DC programming, Research Report. National Institute for Applied Sciences, Rouen, 38 p

  • Larsen N, Mausser H, Uryasev S (2002) Algorithms for optimization of value-at-risk. In: Pardalos P, Tsitsiringos VK(eds)   Financial engineering, E-commerce and supply chain. Kluwer, Norwell, pp 129–157

    Google Scholar 

  • Luo Z-Q, Pang J-S, Ralph D, Wu S-Q (1996) Exact penalization and stationary conditions of mathematical programs with equilibrium constraints. Math Programm 75: 19–76

    Article  Google Scholar 

  • Pang J-S, Leyffer S (2004) On the global minimization of the value-at-risk. Optim Methods Softw 19(5): 611–631

    Article  Google Scholar 

  • Pflug GC (2000) Some remarks on the value-at-risk and the conditional value-at-risk. In: Uryasev S(eds) Probabilistic constrained optimization: methodology and optimization. Kluwer, Norwell, pp 278–287

    Google Scholar 

  • Rockafellar RT (1970) Convex analysis. Princeton University Press, Englewood Cliffs

    Google Scholar 

  • Rockafellar RT, Uryasev S (2000) Optimization of conditional value-at-risk. J Risk 2: 21–41

    Google Scholar 

  • Rockafellar RT, Uryasev S (2002) Conditional value-at-risk for general loss distribution. J Banking Financ 26: 1443–1471

    Article  Google Scholar 

  • Pham Dinh T, Le Thi HA (1997) Convex analysis approach to DC programming: theory, algorithms and applications. Acta Math Vietnamica, dedicated to Professor Hoang Tuy on the occasion of his 70th birthday 22(1): 289–355

    Google Scholar 

  • Pham Dinh T, Le Thi HA (1998) DC optimization algorithms for solving the trust region subproblem. SIAM J Optim 8: 476–505

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tao Pham Dinh.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pham Dinh, T., Nam, N.C. & Le Thi, H.A. DC programming and DCA for globally solving the value-at-risk. Comput Manag Sci 6, 477–501 (2009). https://doi.org/10.1007/s10287-009-0099-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10287-009-0099-2

Keywords

Navigation