Optimal control of reflected diffusion processes

Author(s):  
P. L. Lions
Author(s):  
Ajay Jasra ◽  
Arnaud Doucet

In this paper, we show how to use sequential Monte Carlo methods to compute expectations of functionals of diffusions at a given time and the gradients of these quantities w.r.t. the initial condition of the process. In some cases, via the exact simulation of the diffusion, there is no time discretization error, otherwise the methods use Euler discretization. We illustrate our approach on both high- and low-dimensional problems from optimal control and establish that our approach substantially outperforms standard Monte Carlo methods typically adopted in the literature. The methods developed here are appropriate for solving a certain class of partial differential equations as well as for option pricing and hedging.


2013 ◽  
Vol 45 (4) ◽  
pp. 1137-1156
Author(s):  
Saul C. Leite ◽  
Marcelo D. Fragoso

We consider the problem of reducing the response time of fork-join systems by maintaining the workload balanced among the processing stations. The general problem of modeling and finding an optimal policy that reduces imbalance is quite difficult. In order to circumvent this difficulty, the heavy traffic approach is taken, and the system dynamics are approximated by a reflected diffusion process. This way, the problem of finding an optimal balancing policy that reduces workload imbalance is set as a stochastic optimal control problem, for which numerical methods are available. Some numerical experiments are presented, where the control problem is solved numerically and applied to a simulation. The results indicate that the response time of the controlled system is reduced significantly using the devised control.


1971 ◽  
Vol 8 (03) ◽  
pp. 551-560 ◽  
Author(s):  
R. Morton

Summary Because there are no boundary conditions, extra properties are required in order to identify the correct potential cost function. A solution of the Dynamic Programming equation for one-dimensional processes leads to an optimal solution within a wide class of alternatives (Theorem 1), and is completely optimal if certain conditions are satisfied (Theorem 2). Necessary conditions are also given. Several examples are solved, and some extension to the multidimensional case is shown.


1971 ◽  
Vol 8 (3) ◽  
pp. 551-560 ◽  
Author(s):  
R. Morton

SummaryBecause there are no boundary conditions, extra properties are required in order to identify the correct potential cost function. A solution of the Dynamic Programming equation for one-dimensional processes leads to an optimal solution within a wide class of alternatives (Theorem 1), and is completely optimal if certain conditions are satisfied (Theorem 2). Necessary conditions are also given. Several examples are solved, and some extension to the multidimensional case is shown.


SIAM Review ◽  
1990 ◽  
Vol 32 (3) ◽  
pp. 503-504
Author(s):  
Wendell H. Fleming

Sign in / Sign up

Export Citation Format

Share Document