BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Laboratoire de finance des marchés de l'énergie - ECPv6.5.1.5//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Laboratoire de finance des marchés de l'énergie
X-ORIGINAL-URL:https://fime-lab.org
X-WR-CALDESC:évènements pour Laboratoire de finance des marchés de l'énergie
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20160327T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20161030T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;VALUE=DATE:20161014
DTEND;VALUE=DATE:20161015
DTSTAMP:20240722T140431
CREATED:20160607T123855Z
LAST-MODIFIED:20161018T072701Z
UID:1375-1476403200-1476489599@fime-lab.org
SUMMARY:C. Bender\, Primal-dual methods for BSDEs
DESCRIPTION:SLIDES \nNumerical methods for backward stochastic differential equations (BSDEs) typically consist of two steps. In a first step a time discretization is performed\, which leads to a backward dynamic programming equation. In the second step this dynamic program has to be solved numerically. This second step requires to approximate high order nestings of conditional expectations\, which is a challenging problem in particular when the BSDE is driven by a high-dimensional Brownian motion. In this talk we present a method to construct confidence intervals on the value of the dynamic program\, and hence on the solution of the time-discretized BSDE. This method generalizes the primal-dual approach\, which is popular and well-studied for Bermudan option pricing problems. In a nutshell\, the idea is to derive a maximization problem and a minimization problem such that the value process of both problems coincides with the solution of the dynamic program and such that optimizers can be represented in terms of the solution of the dynamic program. Using an approximate solution to the dynamic program\, which can be precomputed by any algorithm\, then leads to `close-to-optimal' controls for these optimization problems and to `tight' lower and upper bounds for the time-discretized BSDE\, provided that the algorithm for constructing the approximate solution was `successful'. We illustrate the method numerically for several nonlinear option pricing problems\, which can be formulated in terms of BSDEs. \nThe talk is based on joint work with N. Schweizer\, J. Zhuo\, and C. Gärtner.
URL:https://fime-lab.org/event/primal-dual-methods-for-bsdes/
END:VEVENT
END:VCALENDAR