2007
DOI: 10.21314/jcf.2007.163
|View full text |Cite
|
Sign up to set email alerts
|

Numerical methods for controlled Hamilton-Jacobi-Bellman PDEs in finance

Abstract: Many nonlinear option pricing problems can be formulated as optimal control problems, leading to Hamilton-Jacobi-Bellman (HJB) or Hamilton-Jacobi-Bellman-Isaacs (HJBI) equations. We show that such formulations are very convenient for developing monotone discretization methods which ensure convergence to the financially relevant solution, which in this case is the viscosity solution. In addition, for the HJB type equations, we can guarantee convergence of a Newton-type (Policy) iteration scheme for the nonlinea… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
189
0
1

Year Published

2007
2007
2023
2023

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 146 publications
(190 citation statements)
references
References 48 publications
(92 reference statements)
0
189
0
1
Order By: Relevance
“…(2007), we propose an efficient finite difference scheme following the penalty approximation approach to solve for the fair value of the annuities. The numerical procedure of using the penalty approximation approach represents a nice contribution to the family of numerical methods for solving singular stochastic control problems (Kumar and Muthuraman, 2004;Forsyth and Labahn, 2006). In addition, we design the finite difference scheme that allows for discrete jumps across discrete withdrawal dates for solving the discrete time withdrawal model.…”
Section: Introductionmentioning
confidence: 99%
“…(2007), we propose an efficient finite difference scheme following the penalty approximation approach to solve for the fair value of the annuities. The numerical procedure of using the penalty approximation approach represents a nice contribution to the family of numerical methods for solving singular stochastic control problems (Kumar and Muthuraman, 2004;Forsyth and Labahn, 2006). In addition, we design the finite difference scheme that allows for discrete jumps across discrete withdrawal dates for solving the discrete time withdrawal model.…”
Section: Introductionmentioning
confidence: 99%
“…We use a policy iteration (Forsyth and Labahn, 2008) to solve the discretized PDE in (4.30). Let we only have three possible values because ϕ, ψ ∈ {0, 1} and ϕψ = 0.…”
mentioning
confidence: 99%
“…Following the proof in (Barles and Jakobsen, 2007;Forsyth and Labahn, 2007) and using Lemma 4.1, we can obtain the monotonicity of scheme (4.21). Remark 4.6.…”
Section: Properties Of the Numerical Schemementioning
confidence: 87%
“…We omit the details here. Readers can refer to (D'Halluin et al, 2005, Theorem 5.5) and Forsyth and Labahn (2007) for complete stability proofs of the semi-Lagrangian fully implicit scheme for American Asian options and the finite difference schemes for controlled HJB equations, respectively.…”
Section: Properties Of the Numerical Schemementioning
confidence: 99%