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

Optimizing Sparse Mean-Reverting Portfolio

Author

Listed:
  • Sung Min Yoon

Abstract

Mean-reverting behavior of individuals assets is widely known in financial markets. In fact, we can construct a portfolio that has mean-reverting behavior and use it in trading strategies to extract profits. In this paper, we show that we are able to find the optimal weights of stocks to construct portfolio that has the fastest mean-reverting behavior. We further add minimum variance and sparsity constraints to the optimization problem and transform into Semidefinite Programming (SDP) problem to find the optimal weights. Using the optimal weights, we empirically compare the performance of contrarian strategies between non-sparse mean-reverting portfolio and sparse mean-reverting portfolio to argue that the latter provides higher returns when we take into account of transaction costs.

Suggested Citation

  • Sung Min Yoon, 2024. "Optimizing Sparse Mean-Reverting Portfolio," Papers 2406.17155, arXiv.org.
  • Handle: RePEc:arx:papers:2406.17155
    as

    Download full text from publisher

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

    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:2406.17155. 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: 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.