Complexity and real computation
Complexity and real computation
Newton's method for overdetermined systems of equations
Mathematics of Computation
Newton's method for analytic systems of equations with constant rank derivatives
Journal of Complexity
Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Classics in Applied Mathematics, 16)
The convergence analysis of inexact Gauss---Newton methods for nonlinear problems
Computational Optimization and Applications
A Unifying Local Convergence Result for Newton's Method in Riemannian Manifolds
Foundations of Computational Mathematics
Kantorovich's majorants principle for Newton's method
Computational Optimization and Applications
Convergence behaviour of inexact Newton methods under weak Lipschitz condition
Journal of Computational and Applied Mathematics
Improved generalized differentiability conditions for Newton-like methods
Journal of Complexity
Local convergence analysis of inexact Newton-like methods under majorant condition
Computational Optimization and Applications
Local convergence analysis of inexact Gauss-Newton like methods under majorant condition
Journal of Computational and Applied Mathematics
Computers & Mathematics with Applications
Hi-index | 0.00 |
The Gauss-Newton method for solving nonlinear least squares problems is studied in this paper. Under the hypothesis that the derivative of the function associated with the least square problem satisfies a majorant condition, a local convergence analysis is presented. This analysis allows us to obtain the optimal convergence radius and the biggest range for the uniqueness of stationary point, and to unify two previous and unrelated results.