A PRIMAL–DUAL ALGORITHM FOR BSDES

By Christian Bender, Nikolaus Schweizer, J. Zhuo. 2013

52 citations recorded by the source corpus.

We generalize the primal–dual methodology, which is popular in the pricing of early‐exercise options, to a backward dynamic programming equation associated with time discretization schemes of (reflected) backward stochastic differential equations (BSDEs). Taking as an input some approximate solution of the backward dynamic program, which was precomputed, e.g., by least‐squares Monte Carlo, this methodology enables us to construct a confidence interval for the unknown true solution of the time‐discretized (reflected) BSDE at time 0. We numerically demonstrate the practical applicability of our method in two 5‐dimensional nonlinear pricing problems where tight price bounds were previously unavailable.

Subfields: Finance, Management Science and Operations Research

View Paper: https://www.semanticscholar.org/paper/495fbfafd0de0053a61ee36dbfcc514c72fedaeb

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Finance

  1. Arnulf Jentzen
  2. Christian Beck
  3. Jiequn Han
  4. W. E
  5. Martin Hutzenthaler
  6. Philippe von Wurstemberger
  7. Xuerong Mao
  8. Sotirios Sabanis

In Management Science and Operations Research

  1. Christian Beck
  2. W. E
  3. Martin Hutzenthaler
  4. Arnulf Jentzen
  5. Philippe von Wurstemberger
  6. Jiequn Han
  7. Sotirios Sabanis
  8. Xuerong Mao

Citations in the corpus