Solving optimal stopping problems via empirical dual optimization
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.
- Optimal stopping via pathwise dual empirical maximisation
- Solving optimal stopping problems under model uncertainty via empirical dual optimisation
- From optimal martingales to randomized dual optimal stopping
- On the rates of convergence of simulation-based optimization algorithms for optimal stopping problems
- A new learning algorithm for optimal stopping
- Additive and multiplicative duals for American option pricing
- Asymptotic Statistics
- Best constants in martingale version of Rosenthal's inequality
- Concentration inequalities, large and moderate deviations for self-normalized empirical processes
- Dual valuation and hedging of Bermudan options
- Introduction to empirical processes and semiparametric inference
- Local tail bounds for functions of independent random variables
- Monte Carlo valuation of American options
- Pricing American Options: A Duality Approach
- Pricing American-style securities using simulation
- Pricing Bermudan options by nonparametric regression: optimal rates of convergence for lower estimates
- Self-normalized processes: exponential inequalities, moment bounds and iterated logarithm laws.
- Smooth minimization of non-smooth functions
- TRUE UPPER BOUNDS FOR BERMUDAN PRODUCTS VIA NON‐NESTED MONTE CARLO
- Efficient solutions for a class of optimal stopping problems
- Solving optimal stopping problems under model uncertainty via empirical dual optimisation
- Discrete-type approximations for non-Markovian optimal stopping problems. II
- Optimal stopping via pathwise dual empirical maximisation
- Solving the bilateral group selection problem using optimal stopping options
- Optimal stopping under model uncertainty: randomized stopping times approach
- Sequential design for optimal stopping problems
- Multilevel simulation based policy iteration for optimal stopping -- convergence and complexity
- Dual pricing of American options by Wiener chaos expansion
- Fast estimation of true bounds on Bermudan option prices under jump-diffusion processes
- Dynamic programming for optimal stopping via pseudo-regression
- Solving high-dimensional optimal stopping problems using deep learning
- Discrete-type approximations for non-Markovian optimal stopping problems. I
- Optimal stopping of McKean-Vlasov diffusions via regression on particle systems
- On the compensator in the Doob-Meyer decomposition of the Snell envelope
- A primal-dual algorithm for BSDEs
- Deep optimal stopping
- Iterative improvement of lower and upper bounds for backward SDEs
- Semitractability of optimal stopping problems via a weighted stochastic mesh algorithm
- From optimal martingales to randomized dual optimal stopping
- Solving Optimal Stopping Problems via Randomization and Empirical Dual Optimization
- A Nonparametric Algorithm for Optimal Stopping Based on Robust Optimization
- On the rates of convergence of simulation-based optimization algorithms for optimal stopping problems
- Purely dual approach for optimal stopping problems via regression
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)