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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: On the Landweber iteration for nonlinear ill-posed problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative solution methods for inconsistent linear equations with nonself-adjoint operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convergence analysis of the Landweber iteration for nonlinear ill-posed problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steepest descent for singular linear operators with nonclosed range / rank
 
Normal rank
Property / cites work
 
Property / cites work: A uniform approach to gradient methods for linear operator equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convergence analysis of a method of steepest descent and a two–step algorothm for nonlinear ill–posed problems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4171/zaa/679 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009666499 / rank
 
Normal rank

Latest revision as of 10:50, 30 July 2024

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
    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
    0 references
    0 references
    0 references
    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
    0 references