首页 | 本学科首页   官方微博 | 高级检索  
     检索      


High-dimensional index tracking based on the adaptive elastic net
Authors:Lianjie Shu  Fangquan Shi  Guoliang Tian
Institution:1. Faculty of Business, University of Macau, Macau, People's Republic of China ljshu@umac.moljshu@um.edu.moORCID Iconhttps://orcid.org/0000-0001-6860-698X;4. Faculty of Business, University of Macau, Macau, People's Republic of China;5. Department of Statistics and Data Science, Southern University of Science and Technology, ShenZhen, People's Republic of China
Abstract:When a portfolio consists of a large number of assets, it generally incorporates too many small and illiquid positions and needs a large amount of rebalancing, which can involve large transaction costs. For financial index tracking, it is desirable to avoid such atomized, unstable portfolios, which are difficult to realize and manage. A natural way of achieving this goal is to build a tracking portfolio that is sparse with only a small number of assets in practice. The cardinality constraint approach, by directly restricting the number of assets held in the tracking portfolio, is a natural idea. However, it requires the pre-specification of the maximum number of assets selected, which is rarely practicable. Moreover, the cardinality constrained optimization problem is shown to be NP-hard. Solving such a problem will be computationally expensive, especially in high-dimensional settings. Motivated by this, this paper employs a regularization approach based on the adaptive elastic-net (Aenet) model for high-dimensional index tracking. The proposed method represents a family of convex regularization methods, which nests the traditional Lasso, adaptive Lasso (Alasso), and elastic-net (Enet) as special cases. To make the formulation more practical and general, we also take the full investment condition and turnover restrictions (or transaction costs) into account. An efficient algorithm based on coordinate descent with closed-form updates is derived to tackle the resulting optimization problem. Empirical results show that the proposed method is computationally efficient and has competitive out-of-sample performance, especially in high-dimensional settings.
Keywords:Index tracking  Sparsity  Cardinality  Lasso
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号