Article ID: | iaor20133280 |
Volume: | 235 |
Issue: | 13 |
Start Page Number: | 3859 |
End Page Number: | 3869 |
Publication Date: | May 2011 |
Journal: | Journal of Computational and Applied Mathematics |
Authors: | Zeng Jinping, Sun Zhe, Xu Hongru |
Keywords: | heuristics |
In this paper, some semismooth methods are considered to solve a nonsmooth equation which can arise from a discrete version of the well‐known Hamilton–Jacobi–Bellman equation. By using the slant differentiability introduced by Chen, Nashed and Qi in 2000, a semismooth Newton method is proposed. The method is proved to have monotone convergence by suitably choosing the initial iterative point and local superlinear convergence rate. Moreover, an inexact version of the proposed method is introduced, which reduces the cost of computations and still preserves nice convergence properties. Some numerical results are also reported.