IDEAS home Printed from https://ideas.repec.org/a/eee/dyncon/v177y2025ics0165188925000934.html
   My bibliography  Save this article

Optimal multi-period leverage-constrained portfolios: A neural network approach

Author

Listed:
  • Ni, Chendi
  • Li, Yuying
  • Forsyth, Peter

Abstract

We present a neural network approach for multi-period portfolio optimization that relaxes the long-only restriction and instead imposes a bound constraint on leverage. We formulate the optimization problem for such a relaxed-constraint portfolio as a multi-period stochastic optimal control problem. We propose a novel relaxed-constraint neural network (RCNN) model to approximate the optimal control. Using our proposed RCNN model transforms the original leverage-constrained optimization problem into an unconstrained one, which makes solving it computationally more feasible. We prove mathematically that the proposed RCNN control model can approximate the optimal relaxed-constraint strategy with arbitrary precision. We further propose to compute the optimal outperforming strategy over a benchmark based on cumulative quadratic shortfall (CS). Using U.S. historical market data from Jan 1926 to Jan 2023, we computationally compare and assess the proposed neural network approach to the optimal leverage-constrained strategy and long-only strategy respectively. We demonstrate that the leverage-constrained optimal strategy can achieve enhanced performance over the long-only strategy in outperforming a benchmark portfolio.

Suggested Citation

  • Ni, Chendi & Li, Yuying & Forsyth, Peter, 2025. "Optimal multi-period leverage-constrained portfolios: A neural network approach," Journal of Economic Dynamics and Control, Elsevier, vol. 177(C).
  • Handle: RePEc:eee:dyncon:v:177:y:2025:i:c:s0165188925000934
    DOI: 10.1016/j.jedc.2025.105127
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165188925000934
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.jedc.2025.105127?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

    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:eee:dyncon:v:177:y:2025:i:c:s0165188925000934. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/jedc .

    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.