IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v69y2018i9p1406-1422.html
   My bibliography  Save this article

Optimal trading under non-negativity constraints using approximate dynamic programming

Author

Listed:
  • Shahin Abbaszadeh
  • Tri-Dung Nguyen
  • Yue Wu

Abstract

In this paper, we develop an extended dynamic programming (DP) approach to solve the problem of minimising execution cost in block trading of securities. To make the problem more practical, we add non-negativity constraints to the model and propose a novel approach to solve the resulting DP problem to near-optimal results. We also include time lags in the problem state to account for the autoregressive behaviour of most financial securities as a way of increasing problem sensitivity to variability of prices and information. The computation times achieved for the proposed algorithm are fast and allow for the possibility of live implementation. We demonstrate the benefits offered by the new approach through numerical analysis and simulation runs in comparison to the classic model without the non-negativity constraints.

Suggested Citation

  • Shahin Abbaszadeh & Tri-Dung Nguyen & Yue Wu, 2018. "Optimal trading under non-negativity constraints using approximate dynamic programming," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 69(9), pages 1406-1422, September.
    • Handle: RePEc:taf:tjorxx:v:69:y:2018:i:9:p:1406-1422
    DOI: 10.1080/01605682.2017.1398201
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2017.1398201
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2017.1398201?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. Dimitris Andriosopoulos & Michalis Doumpos & Panos M. Pardalos & Constantin Zopounidis, 2019. "Computational approaches and data analytics in financial services: A literature review," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(10), pages 1581-1599, October.
    2. Yang, Qing-Qing & Ching, Wai-Ki & Gu, Jia-wen & Wong, Tak Kwong & Zhu, Dong-Mei, 2024. "Viscosity solution for optimal liquidation problems with randomly-terminated horizon," Finance Research Letters, Elsevier, vol. 61(C).

    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:tjorxx:v:69:y:2018:i:9:p:1406-1422. 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/tjor .

    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.