论文部分内容阅读
In this paper, motivated by the Martinez and Qi methods[1], we propose one type of globally convergent inexact generalized Newton methods to solve unconstrained optimization problems in which the objective functions are not twice differentiable, but have LC gradient. They make the norm of the gradient decreasing. These methods are implementable and globally convergent. We prove that the algorithms have superlinear convergence rates under some mile conditions.The methods may also be used to solve nonsmooth equations.