IDEAS home Printed from https://ideas.repec.org/p/uts/rpaper/352.html
   My bibliography  Save this paper

Algorithms for Optimal Control of Stochastic Switching Systems

Author

Listed:

Abstract

Optimal c ontrol problems of swit hing type with linear state dynamic s are ubiquitous in appli ations of sto hasti c optimization. For high-dimensional problems of this type, solutions whi h utilize some c onvexity related properties are useful. For su ch problems, we present novel algorithmic solutions whi h require minimal assumptions while demonstrating remarkable computational eff icienc y. Furthermore, we devise pro edures of the primal-dual kind to assess the distan e to optimality of these approximate solutions.

Suggested Citation

  • Juri Hinz & Nicholas Yap, 2015. "Algorithms for Optimal Control of Stochastic Switching Systems," Research Paper Series 352, Quantitative Finance Research Centre, University of Technology, Sydney.
    • Handle: RePEc:uts:rpaper:352
    as

    Download full text from publisher

    File URL: https://www.uts.edu.au/sites/default/files/qfr-archive-03/QFR-rp352.pdf
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Juri Hinz & Jeremy Yee, 2017. "An Algorithmic Approach to Optimal Asset Liquidation Problems," Asia-Pacific Financial Markets, Springer;Japanese Association of Financial Economics and Engineering, vol. 24(2), pages 109-129, June.
    2. Paolo Falbo & Juri Hinz & Piyachat Leelasilapasart & Cristian Pelizzari, 2021. "A Computational Approach to Sequential Decision Optimization in Energy Storage and Trading," JRFM, MDPI, vol. 14(6), pages 1-22, May.
    3. Juri Hinz, 2020. "Resilience Analysis for Double Spending via Sequential Decision Optimization," Research Paper Series 408, Quantitative Finance Research Centre, University of Technology, Sydney.
    4. Hinz, Juri & Yee, Jeremy, 2018. "Optimal forward trading and battery control under renewable electricity generation," Journal of Banking & Finance, Elsevier, vol. 95(C), pages 244-254.
    5. Juri Hinz & Tanya Tarnopolskaya & Jeremy Yee, 2020. "Efficient algorithms of pathwise dynamic programming for decision optimization in mining operations," Annals of Operations Research, Springer, vol. 286(1), pages 583-615, March.
    6. Juri Hinz, 2021. "On Approximate Solutions for Partially Observable Decision Problems," Research Paper Series 421, Quantitative Finance Research Centre, University of Technology, Sydney.

    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:uts:rpaper:352. 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: Duncan Ford (email available below). General contact details of provider: https://edirc.repec.org/data/qfutsau.html .

    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.