A Krylov subspace approach to large portfolio optimization

被引:1
|
作者
Bajeux-Besnainou, Isabelle [1 ]
Bandara, Wachindra [1 ]
Bura, Efstathia [2 ]
机构
[1] George Washington Univ, Dept Finance, Washington, DC 20052 USA
[2] George Washington Univ, Dept Stat, Washington, DC 20052 USA
来源
关键词
Krylov subspaces; Singular systems; Algorithm; Sample covariance matrix; Global minimum portfolio; GMRES; MATRIX;
D O I
10.1016/j.jedc.2012.04.009
中图分类号
F [经济];
学科分类号
02 ;
摘要
With a large number of securities (N) and fewer observations (T), deriving the global minimum variance portfolio requires the inversion of the singular sample covariance matrix of security returns. We introduce the Break-Down Free Generalized Minimum RESidual (BFGMRES), a Krylov subspaces method, as a fully automated approach for deriving the minimum variance portfolio. BFGMRES is a numerical algorithm that provides solutions to singular linear systems without requiring ex-ante assumptions on the covariance structure. Moreover, it is robust to illiquidity and potentially faulty data. US and international stock data are used to demonstrate the relative robustness of BFGMRES to illiquidity when compared to the "shrinkage to market" methodology developed by Ledoit and Wolf (2003). The two methods have similar performance as assessed by the Sharpe ratios and standard deviations for filtered data. In a simulation study, we show that BFGMRES is more robust than shrinkage to market in the presence of data irregularities. Indeed, when there is an illiquid stock shrinkage to market allocates almost 100% of the portfolio weights to this stock, whereas BFGMRES does not. In further simulations, we also show that when there is no illiquidity, BFGMRES exhibits superior performance than shrinkage to market when the number of stocks is high and the sample covariance matrix is highly singular. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:1688 / 1699
页数:12
相关论文
共 50 条
  • [41] Motivations and realizations of Krylov subspace methods for large sparse linear systems
    Bai, Zhong-Zhi
    [J]. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2015, 283 : 71 - 78
  • [42] On the generation of Krylov subspace bases
    Philippe, Bernard
    Reichel, Lothar
    [J]. APPLIED NUMERICAL MATHEMATICS, 2012, 62 (09) : 1171 - 1186
  • [43] Adaptive detectors in the Krylov subspace
    Liu WeiJian
    Xie WenChong
    Li RongFeng
    Wang ZeTao
    Wang YongLiang
    [J]. SCIENCE CHINA-INFORMATION SCIENCES, 2014, 57 (10) : 1 - 11
  • [44] Adaptive detectors in the Krylov subspace
    LIU WeiJian
    XIE WenChong
    LI RongFeng
    WANG ZeTao
    WANG YongLiang
    [J]. Science China(Information Sciences), 2014, 57 (10) : 117 - 127
  • [45] KRYLOV SUBSPACE METHODS ON SUPERCOMPUTERS
    SAAD, Y
    [J]. SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1989, 10 (06): : 1200 - 1232
  • [46] Preconditioned Krylov subspace methods
    Saad, Y
    [J]. ALGORITHMS FOR LARGE SCALE LINEAR ALGEBRAIC SYSTEMS: APPLICATIONS IN SCIENCE AND ENGINEERING, 1998, 508 : 131 - 149
  • [47] Large deviations and portfolio optimization
    Sornette, D
    [J]. PHYSICA A, 1998, 256 (1-2): : 251 - 283
  • [48] A parallel portfolio approach to configuration optimization for large software product lines
    Shi, Kai
    Yu, Huiqun
    Guo, Jianmei
    Fan, Guisheng
    Yang, Xingguang
    [J]. SOFTWARE-PRACTICE & EXPERIENCE, 2018, 48 (09): : 1588 - 1606
  • [49] Krylov Subspace Restart Scheme for Solving Large-Scale Sylvester Equations
    Ahmad, Mian Ilyas
    Jaimoukha, Imad
    Frangos, Michalis
    [J]. 2010 AMERICAN CONTROL CONFERENCE, 2010, : 5726 - 5731
  • [50] A Subspace Approach to Portfolio Analysis A focus on equity investments
    Ganesan, Girish
    [J]. IEEE SIGNAL PROCESSING MAGAZINE, 2011, 28 (05) : 49 - 60