Iterative regularization techniques for ill-posed problems (Q1921704)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 923053
Language Label Description Also known as
default for all languages
No label defined
    English
    Iterative regularization techniques for ill-posed problems
    scientific article; zbMATH DE number 923053

      Statements

      Iterative regularization techniques for ill-posed problems (English)
      0 references
      8 June 1997
      0 references
      First this work presents a survey of recent results on iterative regularization techniques (i.e. strongly convergent and perturbation stable) for solving unstable problems. Afterwards several new results concerning the study of monotone processes for ill-posed operator equations of the first kind in partially ordered spaces are given. Section 1 presents some background information, relevant notions and theorems about regularizability. Section 2 describes certain techniques obtained by means of iterations (successive approximation) for solving variational inequalities with a monotone operator, as well as their applications to linear and quadratic programming. For solving unstable equations with non-monotonic operator the author considers regular one-and three-parameter iterative processes based on the Gauss-Newton method under some conditions on a test and required solutions. In Section 4 he presents another approach to regularization of the successive approximation method for problems with a nonexpanding or quasi-nonexpanding operator based on the introduction of correcting (damping) multipliers into computational schemes. Such an approach permits to ensure strong convergence for modifications of well-known methods (gradient projections method, prox-method), no matter whether the original problem is well-posed or not. Although methods of Gauss-Newton type allow to discard the non-monotonicity conditions, these impose rather rigid requirements upon the choice of a test solution and the a priori conditions for the required solution. In Section 5 by using partially ordered spaces techniques with isotone relative to a cone operator the author succeeds in establishing essentially weaker requirements on the initial approximations and in constructing iterative processes that monotonically converge to the solution. Finally, their applications to nonlinear integral equations are given.
      0 references
      iterative regularization techniques
      0 references
      ill-posed operator equations of the first kind
      0 references
      partially ordered spaces
      0 references
      successive approximation
      0 references
      variational inequalities
      0 references
      monotone operator
      0 references
      quadratic programming
      0 references
      Gauss-Newton method
      0 references
      quasi-nonexpanding operator
      0 references
      convergence
      0 references
      gradient projections method
      0 references
      prox-method
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references