Grant: Discovery Grants Program - Individual
University of Waterloo
$43,000.00
Numerical methods for Hamilton Jacobi Bellman equations in computational finance
EF 2018-19
Résumé
Most problems in finance boil down to making some sort of optimal choice. For example, consider a person saving for retirement. The basic investment choice involves deciding what fraction of the portfolio to invest in a stock index, with the remainder of the portfolio invested in bonds. How should this ratio change, depending on the total accumulated wealth and time until retirement? The problem here is the stochastic (random) behaviour of equity indices. This is a typical problem in optimal stochastic control.*Similarly, anyone who has an on-line broker has likely encountered the use of an optimal stochastic control algorithm. For example, suppose an investor submits an order to buy 1000 shares at a specified limit price. After a few minutes, the investor likely receives notification that the order was filled. However, if the actual trade history is examined (which is usually available to on-line clients), the total buy order will consist of a number of small orders (100-200 shares) all executed at slightly different prices. The idea here is to break up a large order into smaller units, to avoid excessive ""price impact"". Of course breaking up big orders into a number of smaller units opens up the seller to price drops over the length of the sale. In this case we have an example of an optimal trade execution algorithm, which is based on solution of an optimal stochastic control.*This proposal is concerned with developing numerical algorithms for solution of Hamilton-Jacobi-Bellman (HJB) Partial Integro Differential Equations (PIDEs) in financial applications. Optimal stochastic control problems can often be formulated in terms of solving such HJB equations. We focus on numerical algorithms, since practical problems usually have constraints which are difficult to handle if closed form solutions are sought. For example, anyone investing in a real retirement account will be constrained on the amount of leverage they can employ. However, imposing a leverage constraint seems to be very difficult if a closed form solution to the HJB equation is desired, while imposing these sorts of constraints in a numerical context is fairly straightforward.*Non-linear HJB equations typically have multiple non-smooth (i.e. non-differentiable) solutions. This opens up a number of questions, the first being what does it mean to solve a differential equation where the solution is not differentiable? In addition, of the many possible solutions, which is the one we want for our financial applications? In this case, we have to define a solution in the ""viscosity sense"", which is a suitable generalization of what is meant by a solution to a differential equation. It is a non-trivial issue to develop numerical algorithms which are guaranteed to converge to the viscosity solution. This proposal is directed specifically towards devising algorithms which are provably convergent to the viscosity solution of HJB PIDEs.*
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
RGPIN-2017-03760
Name nom
Forsyth, Peter
Department département
Computer Science, David R. Cheriton School of
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2018
Competition year année de concours
2017
Award amount
43000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
Area of application code
802
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Information systems and technology
Area of application fr
Systèmes d'information et technologie de l'information
Research subject code
2955
Research subject group en
Applied mathematics
Research subject group fr
Mathématiques appliquées
Research subject en
Numerical analysis
Research subject fr
Analyse numérique
Partie
2
Nb partie
5
Application title
Numerical methods for Hamilton Jacobi Bellman equations in computational finance
Keyword
NSERC
Application summary
Most problems in finance boil down to making some sort of optimal choice. For example, consider a person saving for retirement. The basic investment choice involves deciding what fraction of the portfolio to invest in a stock index, with the remainder of the portfolio invested in bonds. How should this ratio change, depending on the total accumulated wealth and time until retirement? The problem here is the stochastic (random) behaviour of equity indices. This is a typical problem in optimal stochastic control.*Similarly, anyone who has an on-line broker has likely encountered the use of an optimal stochastic control algorithm. For example, suppose an investor submits an order to buy 1000 shares at a specified limit price. After a few minutes, the investor likely receives notification that the order was filled. However, if the actual trade history is examined (which is usually available to on-line clients), the total buy order will consist of a number of small orders (100-200 shares) all executed at slightly different prices. The idea here is to break up a large order into smaller units, to avoid excessive ""price impact"". Of course breaking up big orders into a number of smaller units opens up the seller to price drops over the length of the sale. In this case we have an example of an optimal trade execution algorithm, which is based on solution of an optimal stochastic control.*This proposal is concerned with developing numerical algorithms for solution of Hamilton-Jacobi-Bellman (HJB) Partial Integro Differential Equations (PIDEs) in financial applications. Optimal stochastic control problems can often be formulated in terms of solving such HJB equations. We focus on numerical algorithms, since practical problems usually have constraints which are difficult to handle if closed form solutions are sought. For example, anyone investing in a real retirement account will be constrained on the amount of leverage they can employ. However, imposing a leverage constraint seems to be very difficult if a closed form solution to the HJB equation is desired, while imposing these sorts of constraints in a numerical context is fairly straightforward.*Non-linear HJB equations typically have multiple non-smooth (i.e. non-differentiable) solutions. This opens up a number of questions, the first being what does it mean to solve a differential equation where the solution is not differentiable? In addition, of the many possible solutions, which is the one we want for our financial applications? In this case, we have to define a solution in the ""viscosity sense"", which is a suitable generalization of what is meant by a solution to a differential equation. It is a non-trivial issue to develop numerical algorithms which are guaranteed to converge to the viscosity solution. This proposal is directed specifically towards devising algorithms which are provably convergent to the viscosity solution of HJB PIDEs.*