Controlled Markov Processes and Viscosity SolutionsThis book is an introduction to optimal stochastic control for continuous time Markov processes and the theory of viscosity solutions. It covers dynamic programming for deterministic optimal control problems, as well as to the corresponding theory of viscosity solutions. New chapters in this second edition introduce the role of stochastic optimal control in portfolio optimization and in pricing derivatives in incomplete markets and two-controller, zero-sum differential games. |
From inside the book
Results 1-5 of 45
Page 4
... minimized. Another possible criterion to be minimized is the time for x(s) to reach a given target. If the target is the point (0,0), then the control function u(·) is to be chosen such that the first time θ when x(θ) = (0,0) is minimized ...
... minimized. Another possible criterion to be minimized is the time for x(s) to reach a given target. If the target is the point (0,0), then the control function u(·) is to be chosen such that the first time θ when x(θ) = (0,0) is minimized ...
Page 6
... minimized . Let us first for- mulate some particular classes of problems ( A through D below ) . Then we subsume all ... minimizes ( 3.4 ) • t1 J ( t , x ; u ) = [ * L ( 8 , x ( s ) , u ( s ) ) ds + ( ( x ( 11 ) ) , t where L = C ( Qo ...
... minimized . Let us first for- mulate some particular classes of problems ( A through D below ) . Then we subsume all ... minimizes ( 3.4 ) • t1 J ( t , x ; u ) = [ * L ( 8 , x ( s ) , u ( s ) ) ds + ( ( x ( 11 ) ) , t where L = C ( Qo ...
Page 7
... minimizing J in ( 3.5 ) subject to an endpoint constraint ( 7 , x ( 7 ) ) € S , where S is a given closed subset of * Q . D. State constraint . This is the problem of minimizing J ( t , x ; u ) in ( 3.4 ) subject to the constraint x ( s ) ...
... minimizing J in ( 3.5 ) subject to an endpoint constraint ( 7 , x ( 7 ) ) € S , where S is a given closed subset of * Q . D. State constraint . This is the problem of minimizing J ( t , x ; u ) in ( 3.4 ) subject to the constraint x ( s ) ...
Page 11
... minimizes ( 4.3 ) at every r . Hence to determine the optimal control u * ( t ) , it suffices to analyze ( 4.3 ) with r arbitrarily close to t . Intuitively this yields a simple optimization problem that is minimized by u * ( t ) ...
... minimizes ( 4.3 ) at every r . Hence to determine the optimal control u * ( t ) , it suffices to analyze ( 4.3 ) with r arbitrarily close to t . Intuitively this yields a simple optimization problem that is minimized by u * ( t ) ...
Page 12
... minimizing ( 3.4 ) . Theorem 5.1 . ( Q = Qo ) . Let WE C1 ( Qo ) satisfy ( 5.3 ) and ( 5.5 ) . Then : ( 5.6 ) W ( t , x ) ≤ V ( t , x ) , \ ( t , x ) Є Q 。. Moreover , if there exists u * ( · ) € U ° ( t ) such that ( 5.7 ) L ( s , x ...
... minimizing ( 3.4 ) . Theorem 5.1 . ( Q = Qo ) . Let WE C1 ( Qo ) satisfy ( 5.3 ) and ( 5.5 ) . Then : ( 5.6 ) W ( t , x ) ≤ V ( t , x ) , \ ( t , x ) Є Q 。. Moreover , if there exists u * ( · ) € U ° ( t ) such that ( 5.7 ) L ( s , x ...
Contents
1 | |
Viscosity Solutions | 57 |
Classical Solutions119 | 118 |
Controlled Markov Diffusions in R | 151 |
SecondOrder Case | 199 |
Logarithmic Transformations and Risk Sensitivity | 227 |
Singular Perturbations 261 | 260 |
Singular Stochastic Control | 293 |
Finite Difference Numerical Approximations | 321 |
Differential Games | 375 |
A Duality Relationships 397 | 396 |
References | 409 |
Index 425 | 424 |
Other editions - View all
Controlled Markov Processes and Viscosity Solutions Wendell H. Fleming,Halil Mete Soner No preview available - 2006 |
Common terms and phrases
admissible control assume assumptions boundary condition boundary data bounded brownian motion C₁ C¹(Q calculus of variations Chapter classical solution consider constant constraint controlled Markov diffusion convergence convex Corollary defined definition denote differential games dynamic programming equation dynamic programming principle Dynkin formula Example exists exit finite formulation given Hence HJB equation holds implies inequality initial data Ishii Lemma linear Lipschitz continuous Markov chain Markov control policy Markov processes minimizing Moreover nonlinear obtain optimal control optimal control problem partial derivatives partial differential equation progressively measurable proof of Theorem prove reference probability system Remark result risk sensitive satisfies Section semigroup Soner stochastic control stochastic control problem stochastic differential equations subset Suppose t₁ Theorem 9.1 uniformly continuous unique value function Verification Theorem viscosity solution viscosity subsolution viscosity supersolution