On the convergence of descent methods (Q1571169)
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: On the convergence of descent methods |
scientific article; zbMATH DE number 1472911
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the convergence of descent methods |
scientific article; zbMATH DE number 1472911 |
Statements
On the convergence of descent methods (English)
0 references
18 February 2004
0 references
For many iterative processes of descent methods it is not possible to obtain an estimate of the convergence to solution point \(x_*\) at a linear rate \[ \rho{(x^k,x_*)}\leq{q^k\rho{(x^0,x_*)}} \forall{k}\in\mathbb{N}. \] At the same time, one is often able to obtain the required estimates in terms of a certain function that is more or less naturally defined. This approach, which may be classified as the second Lyapunov method, is used in this paper. Applications to the numerical solution of nonlinear operator equations with approximate initial data are discussed.
0 references
convergence rate
0 references
second Lyapunov method
0 references
descent methods
0 references
numerical solution
0 references
nonlinear equations
0 references