NANAApr 21, 2016

Inexact Newton's method to nonlinear functions with values in a cone

arXiv:1510.0194717 citationsh-index: 26
Originality Synthesis-oriented
AI Analysis

Provides theoretical guarantees for inexact Newton methods in abstract settings, but the contribution is incremental as it extends existing results using known convex optimization techniques.

This paper proves a robust convergence theorem for inexact Newton's method applied to nonlinear inclusion problems in Banach space, yielding affine invariant versions of Kantorovich's theorem and Smale's α-theorem.

The problem of finding a solution of nonlinear inclusion problems in Banach space is considered in this paper. Using convex optimization techniques introduced by Robinson (Numer. Math., Vol. 19, 1972, pp. 341-347), a robust convergence theorem for inexact Newton's method is proved. As an application, an affine invariant version of Kantorovich's theorem and Smale's α-theorem for inexact Newton's method is obtained.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes