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

First Order BSPDEs in higher dimension for optimal control problems

Author

Listed:
  • Nikolai Dokuchaev

Abstract

The paper studies the First Order BSPDEs (Backward Stochastic Partial Differential Equations) suggested earlier for a case of multidimensional state domain with a boundary. These equations represent analogs of Hamilton-Jacobi-Bellman equations and allow to construct the value function for stochastic optimal control problems with unspecified dynamics where the underlying processes do not necessarily satisfy stochastic differential equations of a known kind with a given structure. The problems considered arise in financial modelling.

Suggested Citation

  • Nikolai Dokuchaev, 2016. "First Order BSPDEs in higher dimension for optimal control problems," Papers 1603.06825, arXiv.org, revised Oct 2018.
    • Handle: RePEc:arx:papers:1603.06825
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. David B. Brown & James E. Smith & Peng Sun, 2010. "Information Relaxations and Duality in Stochastic Dynamic Programs," Operations Research, INFORMS, vol. 58(4-part-1), pages 785-801, August.
    2. Leif Andersen & Mark Broadie, 2004. "Primal-Dual Simulation Algorithm for Pricing Multidimensional American Options," Management Science, INFORMS, vol. 50(9), pages 1222-1234, September.
    3. Christian Bender, 2011. "Dual pricing of multi-exercise options under volume constraints," Finance and Stochastics, Springer, vol. 15(1), pages 1-26, January.
    4. Christian Bender & Nikolai Dokuchaev, 2013. "A First-Order BSPDE for Swing Option Pricing," Papers 1305.3988, arXiv.org.
    5. Martin B. Haugh & Leonid Kogan, 2004. "Pricing American Options: A Duality Approach," Operations Research, INFORMS, vol. 52(2), pages 258-270, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Helin Zhu & Fan Ye & Enlu Zhou, 2013. "Fast Estimation of True Bounds on Bermudan Option Prices under Jump-diffusion Processes," Papers 1305.4321, arXiv.org.
    2. David B. Brown & James E. Smith, 2013. "Optimal Sequential Exploration: Bandits, Clairvoyants, and Wildcats," Operations Research, INFORMS, vol. 61(3), pages 644-665, June.
    3. Vijay V. Desai & Vivek F. Farias & Ciamac C. Moallemi, 2012. "Pathwise Optimization for Optimal Stopping Problems," Management Science, INFORMS, vol. 58(12), pages 2292-2308, December.
    4. Christian Bender & Nikolaus Schweizer & Jia Zhuo, 2013. "A primal-dual algorithm for BSDEs," Papers 1310.3694, arXiv.org, revised Sep 2014.
    5. Dragos Florin Ciocan & Velibor V. Mišić, 2022. "Interpretable Optimal Stopping," Management Science, INFORMS, vol. 68(3), pages 1616-1638, March.
    6. Guoming Lai & François Margot & Nicola Secomandi, 2010. "An Approximate Dynamic Programming Approach to Benchmark Practice-Based Heuristics for Natural Gas Storage Valuation," Operations Research, INFORMS, vol. 58(3), pages 564-582, June.
    7. Christian Bender & Nikolai Dokuchaev, 2013. "A First-Order BSPDE for Swing Option Pricing," Papers 1305.3988, arXiv.org.
    8. Indrajit Mitra & Leonid Kogan, 2014. "Accuracy Verification for Numerical Solutions of Equilibrium Models," 2014 Meeting Papers 423, Society for Economic Dynamics.
    9. Santiago R. Balseiro & David B. Brown, 2019. "Approximations to Stochastic Dynamic Programs via Information Relaxation Duality," Operations Research, INFORMS, vol. 67(2), pages 577-597, March.
    10. Helin Zhu & Fan Ye & Enlu Zhou, 2015. "Fast estimation of true bounds on Bermudan option prices under jump-diffusion processes," Quantitative Finance, Taylor & Francis Journals, vol. 15(11), pages 1885-1900, November.
    11. Daniel R. Jiang & Lina Al-Kanj & Warren B. Powell, 2020. "Optimistic Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds," Operations Research, INFORMS, vol. 68(6), pages 1678-1697, November.
    12. David B. Brown & Martin B. Haugh, 2017. "Information Relaxation Bounds for Infinite Horizon Markov Decision Processes," Operations Research, INFORMS, vol. 65(5), pages 1355-1379, October.
    13. Roger J. A. Laeven & John G. M. Schoenmakers & Nikolaus F. F. Schweizer & Mitja Stadje, 2020. "Robust Multiple Stopping -- A Pathwise Duality Approach," Papers 2006.01802, arXiv.org, revised Sep 2021.
    14. Alessio Trivella & Danial Mohseni-Taheri & Selvaprabu Nadarajah, 2023. "Meeting Corporate Renewable Power Targets," Management Science, INFORMS, vol. 69(1), pages 491-512, January.
    15. Christian Bender & Christian Gaertner & Nikolaus Schweizer, 2016. "Pathwise Iteration for Backward SDEs," Papers 1605.07500, arXiv.org, revised Jun 2016.
    16. Nicolas Essis-Breton & Patrice Gaillardetz, 2020. "Fast Lower and Upper Estimates for the Price of Constrained Multiple Exercise American Options by Single Pass Lookahead Search and Nearest-Neighbor Martingale," Papers 2002.11258, arXiv.org.
    17. Mark Broadie & Weiwei Shen, 2017. "Numerical solutions to dynamic portfolio problems with upper bounds," Computational Management Science, Springer, vol. 14(2), pages 215-227, April.
    18. John Schoenmakers, 2012. "A pure martingale dual for multiple stopping," Finance and Stochastics, Springer, vol. 16(2), pages 319-334, April.
    19. David B. Brown & James E. Smith, 2014. "Information Relaxations, Duality, and Convex Stochastic Dynamic Programs," Operations Research, INFORMS, vol. 62(6), pages 1394-1415, December.
    20. Christian Bender & Christian Gärtner & Nikolaus Schweizer, 2018. "Pathwise Dynamic Programming," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 965-965, August.

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

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.