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

Michael V. Solodov, Benav F. Svaiter
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
more » ... or computing the stepsize we do not use linesearch aimed at decreasing the value of some merit function. Instead, linesearch in the approximate Newton direction is used to construct an appropriate hyperplane which separates the current iterate from the solution set. This step is followed by projecting the current iterate onto this hyperplane, which ensures global convergence of the algorithm. Computational cost of each iteration of our method is of the same order as that of the classical damped Newton method. The crucial advantage is that our method is truly globally convergent. In particular, it cannot get trapped in a stationary point of a merit function. The presented algorithm is motivated by the hybrid projection-proximal point method proposed in [25] .
doi:10.1007/978-1-4757-6388-1_18 fatcat:shsrczod5rbmzj7d66x464s5ki