Iterative improvement of lower and upper bounds for backward SDEs

Christian Bender, Christian Gärtner, Nikolaus Schweizer

Research output: Contribution to journalArticleScientificpeer-review

2 Citations (Scopus)

Abstract

We introduce a novel numerical approach for a class of stochastic dynamic programs which arise as discretizations of backward stochastic differential equations or semilinear partial differential equations. Solving such dynamic programs numerically requires the approximation of nested conditional expectations, i.e., iterated integrals of previous approximations. Our approach allows us to compute and iteratively improve upper and lower bounds on the true solution, starting from an arbitrary and possibly crude input approximation. We demonstrate the benefits of our approach in a high-dimensional financial application.
Original languageEnglish
Pages (from-to)B442-B466
JournalSIAM Journal on Scientific Computing
Volume39
Issue number2
DOIs
Publication statusPublished - 1 Jan 2017

Keywords

  • backward stochastic differential equations
  • dynamic programming
  • iterated improvement
  • Monte Carlo

Fingerprint Dive into the research topics of 'Iterative improvement of lower and upper bounds for backward SDEs'. Together they form a unique fingerprint.

Cite this