Worst-Case Value-at-Risk and Robust Portfolio Optimization: A Conic Programming Approach

  • Authors: Laurent El Ghaoui, Maksim Oks, Francois Oustry.

  • Status: Operations Research, July-August 2003, volume 51, number 4, pp. 543-556.

  • Abstract: Classical formulations of the portfolio optimization problem, such as mean-variance or Value-at-Risk (VaR) approaches, can result in a portfolio extremely sensitive to errors in the data, such as mean and covariance matrix of the returns. In this paper we propose a way to alleviate this problem in a tractable manner. We assume that the distribution of returns is partially known, in the sense that only bounds on the mean and covariance matrix are available. We define the worst-case Value-at-Risk as the largest VaR attainable, given the partial information on the returns’ distribution. We consider the problem of computing and optimizing the worst-case VaR, and we show that these problems can be cast as semidefinite programs. We extend our approach to various other partial information on the distribution, including uncertainty in factor models, support constraints, and relative entropy information.

  • Related entries:

  • Bibtex reference:

 author = {Laurent {{E}l~{G}haoui} and Maksim Oks and Francois Oustry},
 title = {Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach},
 journal = {Oper. Res.},
 volume = {51},
 number = {4},
 year = {2003},
 pages = {543--556},
 publisher = {INFORMS}