Smooth Fit for Some Bellman Equations
نویسنده
چکیده
Two linear-convex deterministic singular control problems in dimensions one and two are considered in this paper. They are solved using the dynamic programming method. The interest here is the explicitness of the results and the relation between the geometry of the drift along the free boundary of these problems and the principle of smooth t. The method of dynamic programming reduces the study of an optimal control problem to the study of a nonlinear partial diierential equation, the Hamilton-Jacobi-Bellman equation (see 6]). The value function for the optimal control problem is a solution of this equation. Singular optimal control problems generally give rise to a free boundary problem for said p.d.e. A basic step in solving the p.d.e. then is that of nding the free boundary. In the problems we consider here, convexity leads to the value function being C 1;1 (Lipschitz rst partial derivatives) across the free bounday. Then a central issue is to determine whether or not the value function is C 2 across the free boundary. The C 2 case is referred to as satisfying the smooth t principle. In stochastic control problems, smooth t occurs in the case of the linear-quadratic-Gaussian problem and it is also known to occur in other examples with nondegenerate diiusion (see 8] and its references). In fact, the property of smooth t was instrumental in solving the celebrated monotone follower problem 1]. On the other hand 8] gives an example where smooth t does not occur. In this paper we present problems in one and two dimensions having no diiusion at all; i.e., deterministic problems. These problems have linear dynamics and a nonnegative control. Other work dealing with problems with nonnegative control appear in 2]-5],,7],,9],10]. Because of the singular nature of our variational problems , we expect the optimal control to be extreme or to be singular. Since our controls are nonnegative this implies that we expect optimal controls to equal zero, innnity, or to be singular. The free boundary separates the null region (where the
منابع مشابه
L-error Estimates for Numerical Approximations of Hamilton-jacobi-bellman Equations
The goal of this paper is to study some numerical approximations of particular Hamilton-Jacobi-Bellman equations in dimension 1 and with possibly discontinuous initial data. We investigate two anti-diffusive numerical schemes; the first one is based on the Ultra-Bee scheme, and the second one is based on the Fast Marching Method. We prove the convergence and derive L1-error estimates for both s...
متن کاملError Bounds for Monotone Approximation Schemes for Hamilton-Jacobi-Bellman Equations
We obtain error bounds for monotone approximation schemes of Hamilton-Jacobi-Bellman equations. These bounds improve previous results of Krylov and the authors. The key step in the proof of these new estimates is the introduction of a switching system which allows the construction of approximate, (almost) smooth supersolutions for the Hamilton-Jacobi-Bellman equation.
متن کاملL 1 - error estimates for numerical approximations of Hamilton - Jacobi - Bellman equations in dimension 1 Olivier
The goal of this paper is to study some numerical approximations of particular HamiltonJacobi-Bellman equations in dimension 1 and with possibly discontinuous initial data. We investigate two anti-diffusive numerical schemes, the first one is based on the Ultra-Bee scheme and the second one is based on the Fast Marching Method. We prove the convergence and derive L-error estimates for both sche...
متن کاملStochastic Optimal Control of Delay Equations Arising in Advertising Models
We consider a class of optimal control problems of stochastic delay differential equations (SDDE) that arise in connection with optimal advertising under uncertainty for the introduction of a new product to the market, generalizing classical work of Nerlove and Arrow [30]. In particular, we deal with controlled SDDE where the delay enters both the state and the control. Following ideas of Vinte...
متن کاملL1-error estimates for numerical approximations of Hamilton-Jacobi-Bellman equations in dimension 1
The goal of this paper is to study some numerical approximations of particular HamiltonJacobi-Bellman equations in dimension 1 and with possibly discontinuous initial data. We investigate two anti-diffusive numerical schemes, the first one is based on the Ultra-Bee scheme and the second one is based on the Fast Marching Method. We prove the convergence and derive L-error estimates for both sche...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994