Non-smooth optimization methods for computation of the conditional value-at-risk and portfolio optimization
Beliakov, Gleb and Bagirov, Adil 2006, Non-smooth optimization methods for computation of the conditional value-at-risk and portfolio optimization, Optimization, vol. 55, no. 5&6, pp. 459-479.
Attached Files
(Some files may be inaccessible until you login with your Deakin Research Online credentials)
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.
Notes
This is an electronic version of an article published in Optimization, Volume 55, Issue 5 & 6 2006 , pages 459 - 479 Optimization is available online at: http://www.informaworld.com/openurl?genre=article&issn=1029-4945&volume=55&issue=5&6&spage=459
Unless expressly stated otherwise, the copyright for items in Deakin Research Online is owned by the author, with all rights reserved.
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO.
If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.