A Penalty Method for the Numerical Solution of Hamilton-Jacobi-Bellman (HJB) Equations in Finance

We present a simple and easy to implement method for the numerical solution of a rather general class of Hamilton-Jacobi-Bellman (HJB) equations. In many cases, the considered problems have only a viscosity solution, to which, fortunately, many intuitive (e.g. finite difference based) discretisations can be shown to converge. However, especially when using fully implicit time stepping schemes with their desirable stability properties, one is still faced with the considerable task of solving the resulting nonlinear discrete system. In this paper, we introduce a penalty method which approximates the nonlinear discrete system to first order in the penalty parameter, and we show that an iterative scheme can be used to solve the penalised discrete problem in finitely many steps. We include a number of examples from mathematical finance for which the described approach yields a rigorous numerical scheme and present numerical results.Comment: 18 Pages, 4 Figures. This updated version has a slightly more detailed introduction. In the current form, the paper will appear in SIAM Journal on Numerical Analysi

Can local single-pass methods solve any stationary Hamilton-Jacobi-Bellman equation?

The use of local single-pass methods (like, e.g., the Fast Marching method) has become popular in the solution of some Hamilton-Jacobi equations. The prototype of these equations is the eikonal equation, for which the methods can be applied saving CPU time and possibly memory allocation. Then, some natural questions arise: can local single-pass methods solve any Hamilton-Jacobi equation? If not, where the limit should be set? This paper tries to answer these questions. In order to give a complete picture, we present an overview of some fast methods available in literature and we briefly analyze their main features. We also introduce some numerical tools and provide several numerical tests which are intended to exhibit the limitations of the methods. We show that the construction of a local single-pass method for general Hamilton-Jacobi equations is very hard, if not impossible. Nevertheless, some special classes of problems can be actually solved, making local single-pass methods very useful from the practical point of view.Comment: 19 page

Some numerical methods for solving stochastic impulse control in natural gas storage facilities

The valuation of gas storage facilities is characterized as a stochastic impulse control problem with finite horizon resulting in Hamilton-Jacobi-Bellman (HJB) equations for the value function. In this context the two catagories of solving schemes for optimal switching are discussed in a stochastic control framework. We reviewed some numerical methods which include approaches related to partial differential equations (PDEs), Markov chain approximation, nonparametric regression, quantization method and some practitioners’ methods. This paper considers optimal switching problem arising in valuation of gas storage contracts for leasing the storage facilities, and investigates the recent developments as well as their advantages and disadvantages of each scheme based on dynamic programming principle (DPP

Fractional Order Version of the HJB Equation

We consider an extension of the well-known Hamilton-Jacobi-Bellman (HJB) equation for fractional order dynamical systems in which a generalized performance index is considered for the related optimal control problem. Owing to the nonlocality of the fractional order operators, the classical HJB equation, in the usual form, does not hold true for fractional problems. Effectiveness of the proposed technique is illustrated through a numerical example.Comment: This is a preprint of a paper whose final and definite form is with 'Journal of Computational and Nonlinear Dynamics', ISSN 1555-1415, eISSN 1555-1423, CODEN: JCNDDM. Submitted 28-June-2018; Revised 15-Sept-2018; Accepted 28-Oct-201

Penalty Methods for the Solution of Discrete HJB Equations -- Continuous Control and Obstacle Problems

In this paper, we present a novel penalty approach for the numerical solution of continuously controlled HJB equations and HJB obstacle problems. Our results include estimates of the penalisation error for a class of penalty terms, and we show that variations of Newton's method can be used to obtain globally convergent iterative solvers for the penalised equations. Furthermore, we discuss under what conditions local quadratic convergence of the iterative solvers can be expected. We include numerical results demonstrating the competitiveness of our methods.Comment: 31 Pages, 7 Figure