Displaying similar documents to “Convergence Analysis of the General Gauss-Newton Algorithm.”

On the semilocal convergence of a two-step Newton-like projection method for ill-posed equations

Ioannis K. Argyros, Santhosh George (2013)

Applicationes Mathematicae

Similarity:

We present new semilocal convergence conditions for a two-step Newton-like projection method of Lavrentiev regularization for solving ill-posed equations in a Hilbert space setting. The new convergence conditions are weaker than in earlier studies. Examples are presented to show that older convergence conditions are not satisfied but the new conditions are satisfied.

Improved local convergence analysis of inexact Newton-like methods under the majorant condition

Ioannis K. Argyros, Santhosh George (2015)

Applicationes Mathematicae

Similarity:

We present a local convergence analysis of inexact Newton-like methods for solving nonlinear equations. Using more precise majorant conditions than in earlier studies, we provide: a larger radius of convergence; tighter error estimates on the distances involved; and a clearer relationship between the majorant function and the associated least squares problem. Moreover, these advantages are obtained under the same computational cost.