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 条
  • [21] Krylov subspace methods to solve large sparse problems on supercomputers
    Yang, Yuexiang
    Li, Xiaomei
    Guofang Keji Daxue Xuebao/Journal of National University of Defense Technology, 1993, 15 (01):
  • [22] Krylov subspace methods for the solution of large systems of ODE's
    Thomsen, PG
    Bjurstrom, NH
    LARGE SCALE COMPUTATIONS IN AIR POLLUTION MODELLING, 1999, 57 : 325 - 338
  • [24] Block Krylov subspace methods for large algebraic Riccati equations
    Jbilou, K
    NUMERICAL ALGORITHMS, 2003, 34 (2-4) : 339 - 353
  • [25] The convergence of Krylov subspace methods for large unsymmetric linear systems
    Jia, ZX
    ACTA MATHEMATICA SINICA-ENGLISH SERIES, 1998, 14 (04) : 507 - 518
  • [26] An inexact Krylov subspace method for large generalized Hankel eigenproblems
    Huang, Zi-Yan
    Feng, Ting-Ting
    SCIENCEASIA, 2024, 50 (05): : 1 - 10
  • [27] Krylov Subspace Approximation for Local Community Detection in Large Networks
    He, Kun
    Shi, Pan
    Bindel, David
    Hopcroft, John E.
    ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2019, 13 (05)
  • [28] KRYLOV SUBSPACE ESTIMATION
    Schneider, Michael K.
    Willsky, Alan S.
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2001, 22 (05): : 1840 - 1864
  • [29] Krylov subspace iteration
    van der Vorst, HA
    COMPUTING IN SCIENCE & ENGINEERING, 2000, 2 (01) : 32 - 37
  • [30] A unified approach to Krylov subspace methods for solving linear systems
    Bouyghf, F.
    Messaoudi, A.
    Sadok, H.
    NUMERICAL ALGORITHMS, 2024, 96 (01) : 305 - 332