2009
DOI: 10.1007/s11075-009-9308-x
|View full text |Cite
|
Sign up to set email alerts
|

On the convergence of Newton-type methods under mild differentiability conditions

Abstract: We introduce the new idea of recurrent functions to provide a new semilocal convergence analysis for Newton-type methods, under mild differentiability conditions. It turns out that our sufficient convergence conditions are weaker, and the error bounds are tighter than in earlier studies in some interesting cases (Chen, Ann Inst Stat

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
7
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(7 citation statements)
references
References 20 publications
0
7
0
Order By: Relevance
“…The Newton method and the Newton-like method are attractive because it converges rapidly from any sufficient initial guess. A number of researchers [3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20] have generalized and established local as well as semilocal convergence analysis of the Newton method Equation (2) under the following conditions:…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The Newton method and the Newton-like method are attractive because it converges rapidly from any sufficient initial guess. A number of researchers [3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20] have generalized and established local as well as semilocal convergence analysis of the Newton method Equation (2) under the following conditions:…”
Section: Introductionmentioning
confidence: 99%
“…for each n ≥ 0. More precisely, Parhi and Gupta [21] have studied the semilocal convergence analysis of Equation (8) for computing a solution of the operator Equation 5, where G : D ⊂ X → X is a nonlinear Fréchet differentiable operator defined on an open convex subset D under the condition:…”
Section: Introductionmentioning
confidence: 99%
“…for each n ≥ 0, where F ′ x denotes the Fréchet derivative of F at point x ∈ D. The Newton method and the Newton-like methods are attractive because it converges rapidly from any sufficient initial guess. A number of researchers [7,[10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25] have generalized and established local as well as semilocal convergence analysis of the Newton method (1.2) under the following conditions:…”
Section: Introductionmentioning
confidence: 99%
“…In order to avoid the use of the inverse of the derivative of the operator F involved in S, some authors (see, for example, [6,4,3,8,18,26]) studied the Newton-like method given by…”
Section: Introductionmentioning
confidence: 99%
“…4) where ω is a nondecreasing and non-negative function on R + . They considered a function h : [0, 1] → R + such that ω(st) ≤ h(s)ω(t)…”
Section: Introductionmentioning
confidence: 99%