DocumentCode
3210861
Title
On cardinality constrained mean-CVaR portfolio optimization
Author
Runze Cheng ; Jianjun Gao
Author_Institution
Dept. of Autom., Shanghai Jiao Tong Univ., Shanghai, China
fYear
2015
fDate
23-25 May 2015
Firstpage
1074
Lastpage
1079
Abstract
Due to the transaction cost and other market friction, investor usually holds only small number of stocks to construct portfolio. This common phenomena motives us to study the cardinality constrained portfolio optimization model. Instead of using the traditional mean-variance criteria, we use the Conditional Value-at-Risk(CVaR) as the risk measure to build the cardinality constrained portfolio optimization model. This problem is a NP hard optimization problem, which can be reformulated as an mixed-integer programming problem. To evaluate the CVaR, it is necessary to generate a large number of scenario, which increases the size of this problem significantly. Thus, it is not practical to solve the resulted mixed-integer programming problem directly. Instead, we propose to use the reweighed l1-norm method to find the approximated solution of this problem. The flexibility of the choosing different weights enables us to achieve different degree of the sparse portfolio. The computational experiments show the prominent feature of this approach.
Keywords
computational complexity; integer programming; investment; risk management; CVaR; NP hard optimization problem; cardinality constrained portfolio optimization model; conditional value-at-risk; mixed-integer programming problem; Approximation methods; Covariance matrices; Investment; Optimization; Portfolios; Programming; Reactive power; Cardinality Constraint; Conditional Value-at-Risk; Portfolio Optimization; Sparse Portfolio;
fLanguage
English
Publisher
ieee
Conference_Titel
Control and Decision Conference (CCDC), 2015 27th Chinese
Conference_Location
Qingdao
Print_ISBN
978-1-4799-7016-2
Type
conf
DOI
10.1109/CCDC.2015.7162076
Filename
7162076
Link To Document