Additional Information
| Author(s) | Argyros, Ioannis K., Cho, Yeol Je, George, Santhosh |
|---|
Extended convergence of Gauss-Newton’s method and uniqueness of the solution
Argyros, Ioannis K., George, Santhosh and Cho, Yeol Je
Abstract
carpathian_2018_34_2_135_142_abstract
The aim of this paper is to extend the applicability of the Gauss-Newton’s method for solving nonlinear least squares problems using our new idea of restricted convergence domains. The new technique uses tighter Lipschitz functions than in earlier papers leading to a tighter ball convergence analysis.
Recently posted
-
A self-adaptive forward-backward-forward algorithm for solving split variational inequalities
-
On the solution of the generalized functional equation arising in mathematical psychology and theory of learning approached by the Banach fixed point theorem
-
A note on the generators of the polynomial algebra of six variables and application
-
Levitin-Polyak Well-Posedness for Parametric Set Optimization Problem
-
The Non-Existence of Convex Configuration for a Given Set of Vertex-Norm in Two-Dimensional Space
-
Strong duality in parametric robust semi-definite linear programming and exact relaxations
-
Convergence theorem for an intermixed iteration in p-uniformly convex metric space
-
A Comparative Study between Haploid Genetic Algorithms and Diploid Genetic Algorithms
-
On approximating fixed points of weak enriched contraction mappings via Kirk's iterative algorithm in Banach spaces
-
Analysis of interactions between human immune system and a pathogenic virus