File(s) under permanent embargo
Non-smooth optimization methods for computation of the conditional value-at-risk and portfolio optimization
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.
History
Journal
OptimizationVolume
55Issue
5&6Pagination
459 - 479Publisher
Taylor & FrancisLocation
London, EnglandPublisher DOI
ISSN
0233-1934eISSN
1029-4945Language
engNotes
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=459Publication classification
C1.1 Refereed article in a scholarly journalCopyright notice
2006, Taylor & FrancisUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC