A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A Globally Convergent Inexact Newton Method for Systems of Monotone Equations
[chapter]

1998
*
Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods
*

We propose an algorithm for solving systems of monotone equations which combines Newton, proximal point, and projection methodologies. An important property of the algorithm is that the whole sequence of iterates is always globally convergent to a solution of the system without any additional regularity assumptions. Moreover, under standard assumptions the local superlinear rate of convergence is achieved. As opposed to classical globalization strategies for Newton methods, for computing the

doi:10.1007/978-1-4757-6388-1_18
fatcat:shsrczod5rbmzj7d66x464s5ki