Convergence analysis of the general Gauss-Newton algorithm (Q796257)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Convergence analysis of the general Gauss-Newton algorithm |
scientific article; zbMATH DE number 3864394
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convergence analysis of the general Gauss-Newton algorithm |
scientific article; zbMATH DE number 3864394 |
Statements
Convergence analysis of the general Gauss-Newton algorithm (English)
0 references
1985
0 references
The convergence of the Gauss-Newton algorithm for solving discrete nonlinear approximation problems is analyzed for general norms and families of functions. A quantitative global convergence theorem and several theorems on the rate of local convergence are derived. A general stepsize control procedure and two regularization principles are incorporated. Examples indicate the limits of the convergence theorems.
0 references
convergence
0 references
Gauss-Newton algorithm
0 references
discrete nonlinear approximation
0 references
global convergence
0 references
local convergence
0 references
stepsize control
0 references
regularization
0 references
0 references
0 references
0 references
