2007
DOI: 10.1007/s10114-007-0963-3
|View full text |Cite
|
Sign up to set email alerts
|

On the Convergence of Broyden-Like Methods

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
13
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
5

Relationship

3
2

Authors

Journals

citations
Cited by 6 publications
(13 citation statements)
references
References 6 publications
0
13
0
Order By: Relevance
“…Using our new idea of recurrent functions, a combination of Lipschitz and center-Lipschitz conditions on the first Fréchet-derivative, instead of only Lipschitz conditions [10], we provided an analysis with the following advantages over the work in [4,10,11,13,16,19,20]: weaker sufficient convergence conditions, and larger convergence domain. Note that these advantages are obtained under the same computational cost as in [10], since in practice the computation of the Lipschitz constant K requires the computation of K 0 (see Sect.…”
Section: Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…Using our new idea of recurrent functions, a combination of Lipschitz and center-Lipschitz conditions on the first Fréchet-derivative, instead of only Lipschitz conditions [10], we provided an analysis with the following advantages over the work in [4,10,11,13,16,19,20]: weaker sufficient convergence conditions, and larger convergence domain. Note that these advantages are obtained under the same computational cost as in [10], since in practice the computation of the Lipschitz constant K requires the computation of K 0 (see Sect.…”
Section: Resultsmentioning
confidence: 99%
“…We provide a convergence analysis based on our new idea of recurrent functions. In particular, using the majorant method [1][2][3][4][5][6], and more precise majorizing sequences than before [4,10,11,13,16,19,20], we provide under the same hypotheses and computational cost: in the semilocal case finer error bounds on the distances x n+1 − x n , x n − x , (n ≥ 0), and more precise information on the location of the solution x .…”
Section: Introductionmentioning
confidence: 87%
See 2 more Smart Citations
“…In such cases, the iteration sequences converge to an optimal solution of the problem at hand. Since all of these methods have the same recursive structure, they can be introduced and discussed in a general framework [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19].…”
Section: Introductionmentioning
confidence: 99%