1997
DOI: 10.1002/(sici)1099-1514(199711/12)18:6<423::aid-oca612>3.0.co;2-5
|Get access via publisher |Summarize |Cite
Approximation of integro-differential equations associated with piecewise deterministic process
Abstract: Aim of this paper is to present an approximation scheme for optimal control problems of piecewise deterministic processes and corresponding integro‐differential Hamilton–Jacobi–Bellman equations. The method is based on a discrete dynamic programming approach. We discretize the continuous process and the cost functional obtaining a discrete time optimal control problem. The corresponding dynamic programming equation gives an approximation of the integro‐differential equation. The main feature of the method is t…
Search citation statements
Paper Sections
Select...
8
1
0
0
Citation Types
0
4
0
0
Year Published
2001
2023
Publication Types
Select...
3
3
2
Relationship
1
7
Authors
Journals
Cited by 8 publications
(4 citation statements)
References 15 publications
0
4
0
0
“…In the first order case and when the Levy measure is bounded, convergence rate 1/2 for semi-Lagrangian schemes like (3.8) have previously be obtained in [16]. However the integral term in [16] has a different form compared to the one we consider here.…”
Section: Convergence Estimates For the Discrete-time Problemmentioning
confidence: 81%
“…In the first order case and when the Levy measure is bounded, convergence rate 1/2 for semi-Lagrangian schemes like (3.8) have previously be obtained in [16]. However the integral term in [16] has a different form compared to the one we consider here.…”
Section: Convergence Estimates For the Discrete-time Problemmentioning
confidence: 81%
“…In [11] it is proved that u is the unique viscosity solution of equation (1.1). Following the approach of [16,17] we construct an approximation scheme for the equation (1.1) by discretizing the associated control problem. We fix a discretization step h > 0 and consider two stochastic processes N n and Z n , n ∈ N, taking values in N and in R N and representing the n-th jump time and the corresponding z-jump (size and direction) of the Poisson measure μ.…”
Section: Construction Of the Schemementioning
confidence: 99%
“…where we set the discount factor β = e −ωh . Camilli (1997) shows that V h (x, i) satisfies the following dynamic programming equation…”
Section: P Hmentioning
confidence: 99%
