A computational study on robust portfolio selection based on a joint ellipsoidal uncertainty set

Research output: Contribution to journalArticle

16 Scopus citations

Abstract

The "separable" uncertainty sets have been widely used in robust portfolio selection models [e.g., see Erdoǧan et al. (Robust portfolio management. manuscript, Department of Industrial Engineering and Operations Research, Columbia University, New York, 2004), Goldfarb and Iyengar (Math Oper Res 28:1-38, 2003), Tütüncü and Koenig (Ann Oper Res 132:157-187, 2004)]. For these uncertainty sets, each type of uncertain parameters (e.g., mean and covariance) has its own uncertainty set. As addressed in Lu (A new cone programming approach for robust portfolio selection, technical report, Department of Mathematics, Simon Fraser University, Burnaby, 2006; Robust portfolio selection based on a joint ellipsoidal uncertainty set, manuscript, Department of Mathematics, Simon Fraser University, Burnaby, 2008), these "separable" uncertainty sets typically share two common properties: (i) their actual confidence level, namely, the probability of uncertain parameters falling within the uncertainty set is unknown, and it can be much higher than the desired one; and (ii) they are fully or partially box-type. The associated consequences are that the resulting robust portfolios can be too conservative, and moreover, they are usually highly non-diversified as observed in the computational experiments conducted in this paper and Tütüncü and Koenig (Ann Oper Res 132:157-187, 2004). To combat these drawbacks, the author of this paper introduced a "joint" ellipsoidal uncertainty set (Lu in A new cone programming approach for robust portfolio selection, technical report, Department of Mathematics, Simon Fraser University, Burnaby, 2006; Robust portfolio selection based on a joint ellipsoidal uncertainty set, manuscript, Department of Mathematics, Simon Fraser University, Burnaby, 2008) and showed that it can be constructed as a confidence region associated with a statistical procedure applied to estimate the model parameters. For this uncertainty set, we showed in Lu (A new cone programming approach for robust portfolio selection, technical report, Department of Mathematics, Simon Fraser University, Burnaby, 2006; Robust portfolio selection based on a joint ellipsoidal uncertainty set, manuscript, Department of Mathematics, Simon Fraser University, Burnaby, 2008) that the corresponding robust maximum risk-adjusted return (RMRAR) model can be reformulated and solved as a cone programming problem. In this paper, we conduct computational experiments to compare the performance of the robust portfolios determined by the RMRAR models with our "joint" uncertainty set (Lu in A new cone programming approach for robust portfolio selection, technical report, Department of Mathematics, Simon Fraser University, Burnaby, 2006; Robust portfolio selection based on a joint ellipsoidal uncertainty set, manuscript, Department of Mathematics, Simon Fraser University, Burnaby, 2008) and Goldfarb and Iyengar's "separable" uncertainty set proposed in the seminal paper (Goldfarb and Iyengar in Math Oper Res 28:1-38, 2003). Our computational results demonstrate that our robust portfolio outperforms Goldfarb and Iyengar's in terms of wealth growth rate and transaction cost, and moreover, ours is fairly diversified, but Goldfarb and Iyengar's is surprisingly highly non-diversified.

Original languageEnglish (US)
Pages (from-to)193-201
Number of pages9
JournalMathematical Programming
Volume126
Issue number1
DOIs
StatePublished - Jan 1 2011
Externally publishedYes

Keywords

  • Cone programming
  • Ellipsoidal uncertainty set
  • Robust portfolio selection

Fingerprint Dive into the research topics of 'A computational study on robust portfolio selection based on a joint ellipsoidal uncertainty set'. Together they form a unique fingerprint.

  • Cite this