scientific article; zbMATH DE number 1054896
Initial value problems for linear higher-order PDEs (35G10) Higher-order parabolic equations (35K25) PDEs on infinite-dimensional (e.g., function) spaces (= PDEs in infinitely many variables) (35R15) Dynamic programming in optimal control and differential games (49L20) Equations in function spaces; evolution equations (58D25)
Numerical treatment of optimal stopping time problems for evolution equations is presented. A simple test problem is used to examine complexity and reliability of numerical schemes for its approximation. In Section 2 the problem is posed and convergence of approximate value functions is proved. The next section is devoted to the convergence of optimal solutions, whereas in the last section the fully discrete algorithm is presented and the results of a numerical test are discussed. For the entire collection see [Zbl 0864.00059].
- ON THE RATE OF CONVERGENCE OF APPROXIMATION SCHEMES FOR BELLMAN EQUATIONS ASSOCIATED WITH OPTIMAL STOPPING TIME PROBLEMS
- Numerical methods for an optimal multiple stopping problem
- On the approximation of optimal stopping problems with application to financial mathematics
- scientific article; zbMATH DE number 1900176
- Discussion of dynamic programming and linear programming approaches to stochastic control and optimal stopping in continuous time
- Representations for optimal stopping under dynamic monetary utility functionals
- scientific article; zbMATH DE number 1900176 (Why is no real title available?)
- Dynamic programming for optimal stopping via pseudo-regression
- On the optimization of pit stop strategies via dynamic programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4352447)