IDEAS home Printed from https://ideas.repec.org/a/taf/quantf/v23y2023i9p1361-1372.html
   My bibliography  Save this article

High-dimensional sparse index tracking based on a multi-step convex optimization approach

Author

Listed:
  • Fangquan Shi
  • Lianjie Shu
  • Yiling Luo
  • Xiaoming Huo

Abstract

Both convex and non-convex penalties have been widely proposed to tackle the sparse index tracking problem. Owing to their good property of generating sparse solutions, penalties based on the least absolute shrinkage and selection operator (LASSO) and its variations are often suggested in the stream of convex penalties. However, the LASSO-type penalty is often shown to have poor out-of-sample performance, due to the relatively large biases introduced in the estimates of tracking portfolio weights by shrinking the parameter estimates toward to zero. On the other hand, non-convex penalties could be used to improve the bias issue of LASSO-type penalty. However, the resulting problem is non-convex optimization and thus is computationally intensive, especially in high-dimensional settings. Aimed at ameliorating bias introduced by LASSO-type penalty while preserving computational efficiency, this paper proposes a multi-step convex optimization approach based on the multi-step weighted LASSO (MSW-LASSO) for sparse index tracking. Empirical results show that the proposed method can achieve smaller out-of-sample tracking errors than those based on LASSO-type penalties and have performance competitive to those based on non-convex penalties.

Suggested Citation

  • Fangquan Shi & Lianjie Shu & Yiling Luo & Xiaoming Huo, 2023. "High-dimensional sparse index tracking based on a multi-step convex optimization approach," Quantitative Finance, Taylor & Francis Journals, vol. 23(9), pages 1361-1372, September.
  • Handle: RePEc:taf:quantf:v:23:y:2023:i:9:p:1361-1372
    DOI: 10.1080/14697688.2023.2236158
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/14697688.2023.2236158?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.

    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:quantf:v:23:y:2023:i:9:p:1361-1372. 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/RQUF20 .

    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.