主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

Chinese Journal of Management Science ›› 2017, Vol. 25 ›› Issue (10): 11-19.doi: 10.16381/j.cnki.issn1003-207x.2017.10.002

• Articles • Previous Articles     Next Articles

A Nonsmooth Optimization Method for Portfolio Optimization Based on CVaR

ZHANG Qing-ye1,2, GAO Yan1   

  1. 1. School of Management, University of Shanghai for Science and Technology, Shanghai 200093, China;
    2. Henan Institute of Techonology, Xinxiang, 453003, China
  • Received:2015-06-10 Revised:2017-01-04 Online:2017-10-20 Published:2017-12-15

Abstract: Portfolio selection is an important issue in finance. It aims to determine how to allocate one's wealth among a given asset pool to maximize the return and minimize the risk. Different from the accepted return, there are many risk measures. Nevertheless, among all risk measures, conditional value-at-risk (CVaR) is widely accepted, and in this paper it is adopted. As there is a nonsmooth term in the expression of CVaR, an optimization problem containing CVaR cannot be solved by classical algorithms based on gradient. Though there is an extensive literature on tackling optimization problem containing CVaR, such as linear programming method, intelligent optimization algorithms and nonsmooth optimization methods, etc, literatures on solving this problem by bundle method are scarce. And the literature on this aspect in this paper is enriched. That is, a bundle method is investigated for portfolio selection problem based on CVaR. Specifically, a single-period portfolio optimization model, which takes CVaR as the objective function coupled with a prescribed minimal level of the expected return, is formulated at first. By exploring the structure of the model, a proximal bundle method is proposed. At the same time, the convergence analysis of the method is given as well. Finally, an illustrative numerical example is presented, where assets' returns are assumed to be normally distributed and their mean and the covariance matrix known. By Monte Carlo sampling method, several scenario matrices are generated. Then, not only the bundle method, but linear programming method, subgradient algorithm, genetic algorithm and smoothing method are adopted to solve the model as well. By comparing the results of the different methods, conclusions are drawn:linear programming method and subgradient algorithm are inefficient, genetic algorithm, smoothing method and bundle method are feasible. Further, among three feasible algorithms, bundle method takes the least amount of CPU time. So, the proximal bundle method is efficient and can be regarded as a new solution method for not only portfolio optimization problem but other problems containing CVaR.

Key words: portfolio, Conditional Valu-at-Risk (CVaR), nonsmooth optimization, bundle method

CLC Number: