On Weak Approximation of Stochastic Differential Equations through Hard Bounds by Mathematical Programming

Upper and lower hard bounds of the expected value on stochastic differential equations can be obtained with the help of mathematical programming and the Dynkin formula, without recourse to Monte Carlo sample paths simulation. In this paper, we show that feasible solutions of those optimization approaches further provide useful additional information. Namely, feasible solutions provide upper and lower bounds for arbitrary intermediate times and/or different initial states. We also show that the optimization approach can be applied to stochastic differential equations with a random initial state. Our theoretical analyses are illustrated by numerical results on the survival probability for a square-root diffusion, on the moment estimation of a Doleans--Dade stochastic exponential with jumps, and on pricing of a barrier basket option under the multiasset Black--Scholes model.

[1]  J. Lasserre,et al.  SDP vs. LP Relaxations for the Moment Approach in Some Performance Evaluation Problems , 2004 .

[2]  Kenji Kashima,et al.  Polynomial programming approach to weak approximation of Lévy-driven stochastic differential equations with application to option pricing , 2009, 2009 ICCAS-SICE.

[3]  Philip Protter,et al.  The Euler scheme for Lévy driven stochastic differential equations , 1997 .

[4]  J.A. Primbs,et al.  Optimization based option pricing bounds via piecewise polynomial super- and sub-martingales , 2008, 2008 American Control Conference.

[5]  K. Kashima,et al.  An optimization approach to weak approximation of stochastic differential equations with jumps , 2011 .

[6]  D. Applebaum Lévy Processes and Stochastic Calculus: Preface , 2009 .

[7]  P. Kloeden,et al.  Numerical Solution of Stochastic Differential Equations , 1992 .

[8]  Johan Löfberg,et al.  Pre- and Post-Processing Sum-of-Squares Programs in Practice , 2009, IEEE Transactions on Automatic Control.

[9]  Kurt Helmes,et al.  Computing Moments of the Exit Time Distribution for Markov Processes by Linear Programming , 2001, Oper. Res..

[10]  Kenji Kashima,et al.  An optimization approach to weak approximation of Lévy-driven stochastic differential equations with application to option pricing , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[11]  Pablo A. Parrilo,et al.  Semidefinite programming relaxations for semialgebraic problems , 2003, Math. Program..

[12]  Junichi Imai,et al.  Quasi-Monte Carlo Method for Infinitely Divisible Random Vectors via Series Representations , 2010, SIAM J. Sci. Comput..

[13]  L. Bondesson On simulation from infinitely divisible distributions , 1982, Advances in Applied Probability.

[14]  Aurélien Alfonsi,et al.  High order discretization schemes for the CIR process: Application to affine term structure and Heston models , 2010, Math. Comput..

[15]  Peter J Seiler,et al.  SOSTOOLS: Sum of squares optimization toolbox for MATLAB , 2002 .

[16]  M. Kojima,et al.  A NUMERICAL METHOD FOR SURVIVAL PROBABILITY OF DIFFUSION PROCESSES USING SEMIDEFINITE PROGRAMMING , 2008 .

[17]  K. Kashima,et al.  A Weak Approximation of Stochastic Differential Equations with Jumps Through Tempered Polynomial Optimization , 2011 .