Convergence behavior of Gauss-Newton's method and extensions of the Smale point estimate theory
نویسندگان
چکیده
The notions of Lipschitz conditions with L average are introduced to the study of convergence analysis of Gauss-Newton’s method for singular systems of equations. Unified convergence criteria ensuring the convergence of Gauss-Newton’s method for one kind of singular systems of equations with constant rank derivatives are established and unified estimates of radii of convergence balls are also obtained. Applications to some special cases such as the Kantorovich type conditions, γ-conditions and the Smale point estimate theory are provided and some important known results are extended and/or improved. Keyword: Gauss-Newton’s Method; Majorizing sequence; Convergence criterion; Convergence balls.
منابع مشابه
An Analysis on Local Convergence of Inexact Newton-Gauss Method for Solving Singular Systems of Equations
We study the local convergence properties of inexact Newton-Gauss method for singular systems of equations. Unified estimates of radius of convergence balls for one kind of singular systems of equations with constant rank derivatives are obtained. Application to the Smale point estimate theory is provided and some important known results are extended and/or improved.
متن کاملNewton ’ s method on Riemannian manifolds : Smale ’ s point estimate theory under the γ - condition
Newton’s method and its variants are among the most efficient methods known for solving systems of non-linear equations when the functions involved are continuously differentiable. Besides its practical applications, Newton’s method is also a powerful theoretical tool. Therefore, it has been studied and used extensively. One of the famous results on Newton’s method is the well-known Kantorovich...
متن کاملConvergence Analysis of the Gauss-newton Method for Convex Inclusion Problems and Convex Composite Optimization
Using the convex process theory we study the convergence issues of the iterative sequences generated by the Gauss-Newton method for the convex inclusion problem defined by a cone C and a Fréchet differentiable function F (the derivative is denoted by F ′). The restriction in our consideration is minimal and, even in the classical case (the initial point x0 is assumed to satisfy the following tw...
متن کاملApproximate Zeros of Quadratically Convergent Algorithms
Smale's condition for a point to be an approximate zero of a function for Newton's method is extended to the general quadratically convergent iterative algorithm. It is shown in which way the bound in the condition is affected by the characteristics of the algorithm. This puts the original condition of Smale for Newton's method in a more general perspective. The results are also discussed in th...
متن کاملA Gauss - Newton method for convex composite optimization 1
An extension of the Gauss-Newton method for nonlinear equations to convex composite optimization is described and analyzed. Local quadratic convergence is established for the minimization of h o F under two conditions, namely h has a set of weak sharp minima, C, and there is a regular point of the inclusion F(x) E C. This result extends a similar convergence result due to Womersley (this journa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Complexity
دوره 26 شماره
صفحات -
تاریخ انتشار 2010