Library Header Image
LSE Research Online LSE Library Services

A probabilistic numerical method for optimal multiple switching problems in high dimension

Aïd, René, Campi, Luciano, Langrené, Nicolas and Pham, Huyên (2014) A probabilistic numerical method for optimal multiple switching problems in high dimension. SIAM Journal on Financial Mathematics, 5 (1). pp. 191-231. ISSN 1945-497X

PDF - Accepted Version
Download (1MB) | Preview
Identification Number: 10.1137/120897298


In this paper, we present a probabilistic numerical algorithm combining dynamic programming, Monte Carlo simulations and local basis regressions to solve non-stationary optimal multiple switching problems in infinite horizon. We provide the rate of convergence of the method in terms of the time step used to discretize the problem, of the regression basis used to approximate conditional expectations, and of the truncating time horizon. To make the method viable for problems in high dimension and long time horizon, we extend a memory reduction method to the general Euler scheme, so that, when performing the numerical resolution, the storage of the Monte Carlo simulation paths is not needed. Then, we apply this algorithm to a model of optimal investment in power plants in dimension eight, i.e. with two different technologies and six random factors.

Item Type: Article
Official URL:
Additional Information: © 2014, Society for Industrial and Applied Mathematics
Divisions: Statistics
Subjects: H Social Sciences > HA Statistics
H Social Sciences > HD Industries. Land use. Labor
Date Deposited: 07 Aug 2015 11:12
Last Modified: 07 Jan 2024 01:42

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics