Weaker Kantorovich type criteria for inexact Newton methods
DOI10.1016/j.cam.2013.10.048zbMath1278.65064MaRDI QIDQ390452
Ioannis K. Argyros, Sanjay K. Khattri
Publication date: 8 January 2014
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2013.10.048
semilocal convergence; Banach space; Fréchet derivative; inexact Newton method; center-Lipschitz condition; Kantorovich theory
65H10: Numerical computation of solutions to systems of equations
65N30: Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs
65B05: Extrapolation to the limit, deferred corrections
76M10: Finite element methods applied to problems in fluid mechanics
76W05: Magnetohydrodynamics and electrohydrodynamics
65J20: Numerical solutions of ill-posed problems in abstract spaces; regularization
65G99: Error analysis and interval analysis
Related Items
Cites Work
- Weaker conditions for the convergence of Newton's method
- Smale's \(\alpha \)-theory for inexact Newton methods under the \(\gamma \)-condition
- Extending the Newton-Kantorovich hypothesis for solving equations
- Kantorovich-type convergence criterion for inexact Newton methods
- Relations between forcing sequences and inexact Newton iterates in Banach space
- A new convergence theorem for the inexact Newton methods based on assumptions involving the second Fréchet derivative
- Computational theory of iterative methods.
- New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
- Truncated-Newton algorithms for large-scale unconstrained optimization
- A semilocal convergence analysis for directional Newton methods
- Local Convergence of Inexact Newton Methods
- Inexact Newton Methods
- Convergence of Newton’s method and inverse function theorem in Banach space
- Convergence behaviour of inexact Newton methods
- Adaptive Approximation of Nonlinear Operators
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item