Sparse portfolio selection via the sorted l1-Norm

被引:43
|
作者
Kremer, Philipp J. [1 ,2 ]
Lee, Sangkyun [3 ]
Bogdan, Malgorzata [4 ,5 ]
Paterlini, Sandra [6 ]
机构
[1] Prime Capital AG, Frankfurt, Germany
[2] EBS Univ Wirtschaft & Recht, Wiesbaden, Germany
[3] Hanyang Univ ERICA, Ansan, South Korea
[4] Univ Wroclaw, Warsaw, Poland
[5] Lund Univ, Lund, Sweden
[6] Univ Trento, Trento, Italy
基金
新加坡国家研究基金会;
关键词
Portfolio management; Markowitz model; Sorted l(1)-Norm regularization; Alternating direction method of multipliers; VARIABLE SELECTION; REGRESSION SHRINKAGE; COVARIANCE-MATRIX; SLOPE; REGULARIZATION; PERFORMANCE; CONSTRAINTS; MARKOWITZ;
D O I
10.1016/j.jbankfin.2019.105687
中图分类号
F8 [财政、金融];
学科分类号
0202 ;
摘要
We introduce a financial portfolio optimization framework that allows to automatically select the relevant assets and estimate their weights by relying on a sorted El-Norm penalization, henceforth SLOPE. To solve the optimization problem, we develop a new efficient algorithm, based on the Alternating Direction Method of Multipliers. SLOPE is able to group constituents with similar correlation properties, and with the same underlying risk factor exposures. Depending on the choice of the penalty sequence, our approach can span the entire set of optimal portfolios on the risk-diversification frontier, from minimum variance to the equally weighted. Our empirical analysis shows that SLOPE yields optimal portfolios with good out-of-sample risk and return performance properties, by reducing the overall turnover, through more stable asset weight estimates. Moreover, using the automatic grouping property of SLOPE, new portfolio strategies, such as sparse equally weighted portfolios, can be developed to exploit the data-driven detected similarities across assets. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页数:15
相关论文
共 50 条
  • [21] Binary Compressive Sensing via Sum of l1-norm and l∞-norm Regularization
    Wang, Sheng
    Rahnavard, Nazanin
    2013 IEEE MILITARY COMMUNICATIONS CONFERENCE (MILCOM 2013), 2013, : 1616 - 1621
  • [22] Optimized parameter selection using L1-norm minimization
    You, KH
    Lee, JH
    AUTOMATIC CONTROL AND COMPUTER SCIENCES, 2003, 37 (03) : 23 - 34
  • [23] Unsupervised spectral feature selection with l1-norm graph
    Wang, Xiaodong
    Zhang, Xu
    Zeng, Zhiqiang
    Wu, Qun
    Zhang, Jian
    NEUROCOMPUTING, 2016, 200 : 47 - 54
  • [24] Bregman iteration algorithm for sparse nonnegative matrix factorizations via alternating l1-norm minimization
    Lingling Jiang
    Haiqing Yin
    Multidimensional Systems and Signal Processing, 2012, 23 : 315 - 328
  • [25] Sparse Canonical Correlation Analysis via Truncated l1-norm with Application to Brain Imaging Genetics
    Du, Lei
    Zhang, Tuo
    Liu, Kefei
    Yao, Xiaohui
    Yan, Jingwen
    Risacher, Shannon L.
    Guo, Lei
    Saykin, Andrew J.
    Shen, Li
    2016 IEEE INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICINE (BIBM), 2016, : 707 - 711
  • [26] L1-Norm Regularization for Short-and-Sparse Blind Deconvolution: Point Source Separability and Region Selection
    Wang, Weixi
    Li, Ji
    Ji, Hui
    SIAM JOURNAL ON IMAGING SCIENCES, 2022, 15 (03): : 1345 - 1372
  • [27] Notes on quantum coherence with l1-norm and convex-roof l1-norm
    Zhu, Jiayao
    Ma, Jian
    Zhang, Tinggui
    QUANTUM INFORMATION PROCESSING, 2021, 20 (12)
  • [28] Fluence estimation by deconvolution via l1-norm minimization
    Hernandez, J. Garcia
    Lazaro-Ponthus, D.
    Gmar, M.
    Barthe, J.
    MEDICAL IMAGING 2011: PHYSICS OF MEDICAL IMAGING, 2011, 7961
  • [29] Avoiding Optimal Mean Robust and Sparse BPCA with L1-norm Maximization
    Tang, Ganyi
    Fan, Lili
    Shi, Jianguo
    Tan, Jingjing
    Lu, Guifu
    JOURNAL OF INTERNET TECHNOLOGY, 2023, 24 (04): : 989 - 1000
  • [30] Comparison of l1-Norm SVR and Sparse Coding Algorithms for Linear Regression
    Zhang, Qingtian
    Hu, Xiaolin
    Zhang, Bo
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2015, 26 (08) : 1828 - 1833