Time discretization and quantization methods for optimal multiple switching problem

Paul Gassiat (1) , H. Pham (1) , I. Kharroubi

1 LPMA - Laboratoire de Probabilités et Modèles Aléatoires

In this paper, we study probabilistic numerical methods based on optimal quantization algorithms for computing the solution to optimal multiple switching problems with regime-dependent state process. We first consider a discrete-time approximation of the optimal switching problem, and analyse its rate of convergence. Given a time step h. the error is in general of order (h log(1/h))(1/2), and of order h(1/2) when the switching costs do not depend on the state process. We next propose quantization numerical schemes For the space discretization of the discrete-time Euler state process. A Markovian quantization approach relying on the optimal quantization of the normal distribution arising in the Euler scheme is analysed. In the particular case of uncontrolled state process, we describe an alternative marginal quantization method, which extends the recursive algorithm for optimal stopping problems as in Bally (2003) [I] A priori L-p-error estimates are stated in terms of quantization errors. Finally, some numerical tests are performed for an optimal switching problem with two regimes

Domaines: Probabilités [math.PR]

Paul Gassiat, H. Pham, I. Kharroubi. Time discretization and quantization methods for optimal multiple switching problem. Stochastic Processes and their Applications, 2012, 122 (5), pp.2019-2052. ⟨10.1016/j.spa.2012.02.008⟩. ⟨hal-00714224⟩