Advanced Search

Optimization: A Journal of Mathematical Programming and Operations Research

Volume 55, Issue 5-6, 2006

Special Issue: In Celebration of Prof. Dr. Diethard Pallaschke's 65th Birthday, Guest Editors: Rosalind Elster, Juan-Enrique Martinez-Legaz and Alexander Rubinov

Non-smooth optimization methods for computation of the Conditional Value-at-risk and portfolio optimization

Non-smooth optimization methods for computation of the Conditional Value-at-risk and portfolio optimization

DOI:
10.1080/02331930600816353
Gleb Beliakova* & Adil Bagirovb

pages 459-479

Available online: 29 Oct 2009

Abstract

We examine numerical performance of various methods of calculation of the Conditional Value-at-risk (CVaR), and portfolio optimization with respect to this risk measure. We concentrate on the method proposed by Rockafellar and Uryasev in (Rockafellar, R.T. and Uryasev, S., 2000, Optimization of conditional value-at-risk. Journal of Risk, 2, 21–41), which converts this problem to that of convex optimization. We compare the use of linear programming techniques against a non-smooth optimization method of the discrete gradient, and establish the supremacy of the latter. We show that non-smooth optimization can be used efficiently for large portfolio optimization, and also examine parallel execution of this method on computer clusters.

Keywords

Keywords

 

Details

  • Citation information:
  • Available online: 29 Oct 2009

Author affiliations

  • a School of Information Technology, Deakin University, 221 Burwood Hwy, Burwood 3125, Australia
  • b Centre for Informatics and Applied Optimisation, School of Information Technology and Mathematical Sciences, University of Ballarat, Ballarat 3353, Australia

Librarians

Taylor & Francis Group