Consistency of a simple multidimensional scheme for Hamilton-Jacobi-Bellman equations (Q1773340): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Consistency of Generalized Finite Difference Schemes for the Stochastic HJB Equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the two dimensional HJB equation of stochastic control / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation scheme for the optimal control of diffusion processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2703816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3923524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable resolution discretization in optimal control / rank
 
Normal rank

Revision as of 09:36, 10 June 2024

scientific article
Language Label Description Also known as
English
Consistency of a simple multidimensional scheme for Hamilton-Jacobi-Bellman equations
scientific article

    Statements

    Consistency of a simple multidimensional scheme for Hamilton-Jacobi-Bellman equations (English)
    0 references
    0 references
    0 references
    28 April 2005
    0 references
    The authors consider a multi-valued controlled Markov diffusion on \(X=\mathbb R^n\) \((n\geq 1)\), given as \[ x(t)=x + \int_0^tf(x(s),u(s))ds + \int_0^t\sigma (X(s),u(s))\,dW_s, \] where \((W_t)_{0\leq t\leq \infty}\) is a standard Brownian motion. The control \(u\) is a Lebesgue measurable function with values in a compact set. Further, they assume an infinite horizon discounted payoff and the value function as the minimum value of the payoff, then they consider the associated Hamilton-Jacobi-Bellman (HJB) equation. The authors propose an algorithm for the HJB equation, a Markov decision process approximation, using discretised time steps and diffusion steps. Its consistency is proved, which in turn implies its convergence. The algorithm has the advantage of being easy to implement in any dimension.
    0 references
    stochastic optimal control
    0 references
    Hamilton-Jacobi-Bellman equation of second order
    0 references
    Markov Decision Process approximation
    0 references
    dynamic programming
    0 references
    convergence
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references