Solving optimal stopping problems via empirical dual optimization

From MaRDI portal



Abstract: In this paper we consider a method of solving optimal stopping problems in discrete and continuous time based on their dual representation. A novel and generic simulation-based optimization algorithm not involving nested simulations is proposed and studied. The algorithm involves the optimization of a genuinely penalized dual objective functional over a class of adapted martingales. We prove the convergence of the proposed algorithm and demonstrate its efficiency for optimal stopping problems arising in option pricing.


This paper studies optimal stopping problems in discrete and continuous time. A simulation-based optimization algorithm is presented to solve the problems by the optimization of a genuinely penalized dual objective functional over a class of adapted martingales. A typical feature of the algorithm is that it does not involve nested simulation. Moreover, its convergence and efficiency are proved for problems appearing in option pricing. For example, the related variance can be made arbitrarily small by a proper choice of approximating martingales.




Cited in
(24)








This page was built for publication: Solving optimal stopping problems via empirical dual optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q373842)