On the convergence of an inexact Newton-type method

Authors:
Guanglu Zhou;Liqun Qi
Affiliations:
School of Mathematics, University of Birmingham, Edgbaston, Birmingham B15 2TT, UK;Department of Applied Mathematics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
Venue:
Operations Research Letters
Year:
2006

Citing 10
Cited 2

Topics in matrix analysis

Topics in matrix analysis
A nonsmooth version of Newton's method

Mathematical Programming: Series A and B
Historical developments in convergence analysis for Newton's and Newton-like methods

Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. IV: optimization and nonlinear equations
The theory of Newton's method

Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. IV: optimization and nonlinear equations
The Proximal Point Algorithm with Genuine Superlinear Convergence for the Monotone Complementarity Problem

SIAM Journal on Optimization
A Superlinearly Convergent Algorithm for the Monotone Nonlinear Complementarity Problem Without Uniqueness and Nondegeneracy Conditions

Mathematics of Operations Research
Regularized Newton Methods for Convex Minimization Problems with Singular Solutions

Computational Optimization and Applications
Sub-quadratic convergence of a smoothing Newton algorithm for the P0– and monotone LCP

Mathematical Programming: Series A and B
Levenberg-Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints

Journal of Computational and Applied Mathematics
On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption

Computing

Truncated regularized Newton method for convex minimizations

Computational Optimization and Applications
On the convergence of a modified regularized Newton method for convex optimization with singular solutions

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we give local convergence results of an inexact Newton-type method for monotone equations under a local error bound condition. This condition may hold even for problems with non-isolated solutions, and it therefore is weaker than the standard non-singularity condition.