IDEAS home Printed from https://ideas.repec.org/a/taf/quantf/v26y2026i9p1371-1396.html

Approximate dynamic programming for high-dimensional portfolio choice with transaction costs

Author

Listed:
  • Jörgen Blomvall
  • Jonas Ekblom
  • John R. Birge

Abstract

We present an approximate dynamic programming (ADP) model for the classic dynamic portfolio choice problem faced by an investor with constant relative risk aversion (CRRA) and utility defined over terminal wealth. The model accounts for proportional heterogeneous transaction costs, predictable returns, and portfolio constraints. Specifically, it provides a novel approach to addressing problem instances involving many risky assets and a large number of time periods, a challenge that has proven computationally demanding in the financial literature. We evaluate the performance of the proposed ADP model through numerical experiments involving a risk-free asset and up to ten risky assets over horizons of up to 52 time periods. The results consistently demonstrate superior performance relative to benchmark heuristics. Additionally, the value function approximations generated by the model are used to compute dual bounds, revealing significantly improved duality gaps in most instances. The computational effort required to generate the value function approximations is reasonable, and once obtained, the optimal strategy can be efficiently determined by solving a set of deterministic nonlinear programs.

Suggested Citation

  • Jörgen Blomvall & Jonas Ekblom & John R. Birge, 2026. "Approximate dynamic programming for high-dimensional portfolio choice with transaction costs," Quantitative Finance, Taylor & Francis Journals, vol. 26(9), pages 1371-1396, September.
  • Handle: RePEc:taf:quantf:v:26:y:2026:i:9:p:1371-1396
    DOI: 10.1080/14697688.2026.2708220
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/14697688.2026.2708220?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:taf:quantf:v:26:y:2026:i:9:p:1371-1396. 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.