On Hamilton-Jacobi-Bellman equations with convex gradient constraints (Q345900): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 1412.6202 / rank | |||
Normal rank |
Revision as of 12:50, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On Hamilton-Jacobi-Bellman equations with convex gradient constraints |
scientific article |
Statements
On Hamilton-Jacobi-Bellman equations with convex gradient constraints (English)
0 references
2 December 2016
0 references
Summary: We study PDE of the form \(\max\{F(D^2u,x)-f(x), H(Du)\}=0\) where \(F\) is uniformly elliptic and convex in its first argument, \(H\) is convex, \(f\) is a given function and \(u\) is the unknown. These equations are derived from dynamic programming in a wide class of stochastic singular control problems. In particular, examples of these equations arise in mathematical finance models involving transaction costs, in queuing theory, and spacecraft control problems. The main aspects of this work are to identify conditions under which solutions are uniquely defined and have Lipschitz continuous gradients.
0 references
fully nonlinear
0 references
free boundary problem
0 references
Bernstein's method
0 references