A primal-dual algorithm for BSDEs

Christian Bender, Nikolaus Schweizer and Jia Zhuo

Papers from arXiv.org

Abstract: 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 pre-computed, e.g., by least-squares Monte Carlo, our methodology allows 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 five-dimensional nonlinear pricing problems where tight price bounds were previously unavailable.

Date: 2013-10, Revised 2014-09
References: View references in EconPapers View complete reference list from CitEc
Citations:

Published in Mathematical Finance, Vol. 27, 866-901, 2017

Downloads: (external link)
http://arxiv.org/pdf/1310.3694 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:1310.3694

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().