On Hamilton-Jacobi-Bellman equations with convex gradient constraints

From MaRDI portal
Publication:345900

DOI10.4171/IFB/365zbMATH Open1386.90163arXiv1412.6202OpenAlexW2963846423MaRDI QIDQ345900FDOQ345900


Authors: Ryan Hynd, Henok Mawi Edit this on Wikidata


Publication date: 2 December 2016

Published in: Interfaces and Free Boundaries (Search for Journal in Brave)

Abstract: We study PDE of the form maxF(D2u,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. We also generalize previous results known for the case where MmapstoF(M,x) is the maximum of finitely many linear functions.


Full work available at URL: https://arxiv.org/abs/1412.6202




Recommendations





Cited In (17)





This page was built for publication: On Hamilton-Jacobi-Bellman equations with convex gradient constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q345900)