IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2502.11701.html
   My bibliography  Save this paper

A Cholesky decomposition-based asset selection heuristic for sparse tangent portfolio optimization

Author

Listed:
  • Hyunglip Bae
  • Haeun Jeon
  • Minsu Park
  • Yongjae Lee
  • Woo Chang Kim

Abstract

In practice, including large number of assets in mean-variance portfolios can lead to higher transaction costs and management fees. To address this, one common approach is to select a smaller subset of assets from the larger pool, constructing more efficient portfolios. As a solution, we propose a new asset selection heuristic which generates a pre-defined list of asset candidates using a surrogate formulation and re-optimizes the cardinality-constrained tangent portfolio with these selected assets. This method enables faster optimization and effectively constructs portfolios with fewer assets, as demonstrated by numerical analyses on historical stock returns. Finally, we discuss a quantitative metric that can provide a initial assessment of the performance of the proposed heuristic based on asset covariance.

Suggested Citation

  • Hyunglip Bae & Haeun Jeon & Minsu Park & Yongjae Lee & Woo Chang Kim, 2025. "A Cholesky decomposition-based asset selection heuristic for sparse tangent portfolio optimization," Papers 2502.11701, arXiv.org.
  • Handle: RePEc:arx:papers:2502.11701
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2502.11701
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Francesco Cesarone & Andrea Scozzari & Fabio Tardella, 2013. "A new method for mean-variance portfolio optimization with cardinality constraints," Annals of Operations Research, Springer, vol. 205(1), pages 213-234, May.
    2. Kremer, Philipp J. & Lee, Sangkyun & Bogdan, Małgorzata & Paterlini, Sandra, 2020. "Sparse portfolio selection via the sorted ℓ1-Norm," Journal of Banking & Finance, Elsevier, vol. 110(C).
    3. Yongjae Lee & Min Jeong Kim & Jang Ho Kim & Ju Ri Jang & Woo Chang Kim, 2020. "Sparse and robust portfolio selection via semi-definite relaxation," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 71(5), pages 687-699, May.
    4. Duan Li & Xiaoling Sun & Jun Wang, 2006. "Optimal Lot Solution To Cardinality Constrained Mean–Variance Formulation For Portfolio Selection," Mathematical Finance, Wiley Blackwell, vol. 16(1), pages 83-101, January.
    5. Yu Zheng & Bowei Chen & Timothy M. Hospedales & Yongxin Yang, 2019. "Index Tracking with Cardinality Constraints: A Stochastic Neural Networks Approach," Papers 1911.05052, arXiv.org, revised Nov 2019.
    6. Victor DeMiguel & Lorenzo Garlappi & Francisco J. Nogales & Raman Uppal, 2009. "A Generalized Approach to Portfolio Optimization: Improving Performance by Constraining Portfolio Norms," Management Science, INFORMS, vol. 55(5), pages 798-812, May.
    7. Jianjun Gao & Duan Li, 2013. "Optimal Cardinality Constrained Portfolio Selection," Operations Research, INFORMS, vol. 61(3), pages 745-761, June.
    8. Woo Chang Kim & Yongjae Lee, 2016. "A uniformly distributed random portfolio," Quantitative Finance, Taylor & Francis Journals, vol. 16(2), pages 297-307, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wu, Zhongming & Sun, Kexin & Ge, Zhili & Allen-Zhao, Zhihua & Zeng, Tieyong, 2024. "Sparse portfolio optimization via ℓ1 over ℓ2 regularization," European Journal of Operational Research, Elsevier, vol. 319(3), pages 820-833.
    2. Lioui, Abraham & Tarelli, Andrea, 2022. "Chasing the ESG factor," Journal of Banking & Finance, Elsevier, vol. 139(C).
    3. Martin Branda & Max Bucher & Michal Červinka & Alexandra Schwartz, 2018. "Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization," Computational Optimization and Applications, Springer, vol. 70(2), pages 503-530, June.
    4. Juan Francisco Monge, 2017. "Cardinality constrained portfolio selection via factor models," Papers 1708.02424, arXiv.org.
    5. Mei Choi Chiu & Chi Seng Pun & Hoi Ying Wong, 2017. "Big Data Challenges of High‐Dimensional Continuous‐Time Mean‐Variance Portfolio Selection and a Remedy," Risk Analysis, John Wiley & Sons, vol. 37(8), pages 1532-1549, August.
    6. Lili Pan & Ziyan Luo & Naihua Xiu, 2017. "Restricted Robinson Constraint Qualification and Optimality for Cardinality-Constrained Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 175(1), pages 104-118, October.
    7. Michele Costola & Bertrand Maillet & Zhining Yuan & Xiang Zhang, 2024. "Mean–variance efficient large portfolios: a simple machine learning heuristic technique based on the two-fund separation theorem," Annals of Operations Research, Springer, vol. 334(1), pages 133-155, March.
    8. N. Krejić & E. H. M. Krulikovski & M. Raydan, 2023. "A Low-Cost Alternating Projection Approach for a Continuous Formulation of Convex and Cardinality Constrained Optimization," SN Operations Research Forum, Springer, vol. 4(4), pages 1-24, December.
    9. Tu, Xueyong & Li, Bin, 2024. "Robust portfolio selection with smart return prediction," Economic Modelling, Elsevier, vol. 135(C).
    10. Gaete, Michael & Herrera, Rodrigo, 2023. "Diversification benefits of commodities in portfolio allocation: A dynamic factor copula approach," Journal of Commodity Markets, Elsevier, vol. 32(C).
    11. Wei Xu & Jie Tang & Ka Fai Cedric Yiu & Jian Wen Peng, 2024. "An Efficient Global Optimal Method for Cardinality Constrained Portfolio Optimization," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 690-704, March.
    12. Hongxin Zhao & Lingchen Kong & Hou-Duo Qi, 2021. "Optimal portfolio selections via $$\ell _{1, 2}$$ ℓ 1 , 2 -norm regularization," Computational Optimization and Applications, Springer, vol. 80(3), pages 853-881, December.
    13. Stefania Corsaro & Valentina Simone, 2019. "Adaptive $$l_1$$ l 1 -regularization for short-selling control in portfolio selection," Computational Optimization and Applications, Springer, vol. 72(2), pages 457-478, March.
    14. Nasim Dehghan Hardoroudi & Abolfazl Keshvari & Markku Kallio & Pekka Korhonen, 2017. "Solving cardinality constrained mean-variance portfolio problems via MILP," Annals of Operations Research, Springer, vol. 254(1), pages 47-59, July.
    15. Xiaojin Zheng & Xiaoling Sun & Duan Li, 2014. "Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 690-703, November.
    16. Xiaojin Zheng & Xiaoling Sun & Duan Li & Jie Sun, 2014. "Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach," Computational Optimization and Applications, Springer, vol. 59(1), pages 379-397, October.
    17. Farshad Noravesh, 2022. "Sparse Non-Convex Optimization For Higher Moment Portfolio Management," Papers 2201.01227, arXiv.org, revised Jan 2022.
    18. Fereshteh Vaezi & Seyed Jafar Sadjadi & Ahmad Makui, 2019. "A portfolio selection model based on the knapsack problem under uncertainty," PLOS ONE, Public Library of Science, vol. 14(5), pages 1-19, May.
    19. Vrinda Dhingra & Shiv Kumar Gupta & Amita Sharma, 2023. "Norm constrained minimum variance portfolios with short selling," Computational Management Science, Springer, vol. 20(1), pages 1-35, December.
    20. Janusz Miroforidis, 2021. "Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems," Journal of Global Optimization, Springer, vol. 80(3), pages 617-634, July.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2502.11701. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.