A convergence rate result for a steepest descent method and a minimal error method for the solution of nonlinear ill-posed problems (Q1891946)

From MaRDI portal
Revision as of 09:50, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A convergence rate result for a steepest descent method and a minimal error method for the solution of nonlinear ill-posed problems
scientific article

    Statements

    A convergence rate result for a steepest descent method and a minimal error method for the solution of nonlinear ill-posed problems (English)
    0 references
    0 references
    0 references
    26 November 1995
    0 references
    The paper is devoted to the study of the convergence of a steepest descent method as well as the minimal error method applied to a nonlinear operator equation of the form \(F(x) = y\) for which the solution (which need not be unique) does not depend continuously on the right-hand side data \(y\). Assuming \(F\) is Lipschitz continuously differentiable and that certain additional conditions are satisfied, a convergence rate result is obtained in the noise free case. Finally, these conditions are illustrated for a parameter estimation problem.
    0 references
    nonlinear ill-posed problems
    0 references
    convergence
    0 references
    steepest descent method
    0 references
    minimal error method
    0 references
    nonlinear operator equation
    0 references
    parameter estimation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references