You are not currently logged in.
Access JSTOR through your library or other institution:
Worst-Case Value-at-Risk and Robust Portfolio Optimization: A Conic Programming Approach
Laurent El Ghaoui, Maksim Oks and Francois Oustry
Vol. 51, No. 4 (Jul. - Aug., 2003), pp. 543-556
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/4132418
Page Count: 14
You can always find the topics here!Topics: Covariance, Matrices, Probability distributions, Financial portfolios, Mathematical moments, Investment risk, Componentwise operations, Mathematical vectors, Polytopes, Ellipsoids
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
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.
Operations Research © 2003 INFORMS