IDEAS home Printed from https://ideas.repec.org/a/taf/apeclt/v28y2021i3p201-207.html
   My bibliography  Save this article

CVaR-cardinality enhanced indexation optimization with tunable short-selling constraints

Author

Listed:
  • Zhihua Zhao
  • Hao Wang
  • Xiangyu Yang
  • Fengmin Xu

Abstract

Enhanced-index-funds have attracted considerable attention from investors over the last decade, which aims at outperforming a benchmark index while maintaining a similar risk level. In this article, we investigate an enhanced indexation methodology using Conditional Value-at-Risk (CVaR). In particular, we adopt CVaR of excess returns as risk measurement subject to cardinality constraint for controlling the tracking portfolio scale precisely and tunable short-selling constraints for adjusting the margin of each risky asset adaptively within the budget of short-selling. As the resulted model is a mixed 0–1 binary program, we propose an improved hybrid heuristic method, where a customized relax-round-polish is embedded to improve the quality of the iterative population. Computational results on five standard data sets from OR-library show that our proposed method is generally superior to the naive portfolio strategy and the CVaR-LASSO method in terms of the out-of-sample excess return, Sharpe ratio and maximum drawdown of the portfolio.

Suggested Citation

  • Zhihua Zhao & Hao Wang & Xiangyu Yang & Fengmin Xu, 2021. "CVaR-cardinality enhanced indexation optimization with tunable short-selling constraints," Applied Economics Letters, Taylor & Francis Journals, vol. 28(3), pages 201-207, February.
  • Handle: RePEc:taf:apeclt:v:28:y:2021:i:3:p:201-207
    DOI: 10.1080/13504851.2020.1740156
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/13504851.2020.1740156
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/13504851.2020.1740156?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. F. Hooshmand & Z. Rasouli, 2023. "Enhanced index tracking problem: a new optimization model and a sum-of-ratio based algorithm," OPSEARCH, Springer;Operational Research Society of India, vol. 60(3), pages 1286-1311, September.

    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:taf:apeclt:v:28:y:2021:i:3:p:201-207. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/RAEL20 .

    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.