On a heuristic stopping rule for the regularization of inverse problems by the augmented Lagrangian method (Q2407467)

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 6783366
Language Label Description Also known as
default for all languages
No label defined
    English
    On a heuristic stopping rule for the regularization of inverse problems by the augmented Lagrangian method
    scientific article; zbMATH DE number 6783366

      Statements

      On a heuristic stopping rule for the regularization of inverse problems by the augmented Lagrangian method (English)
      0 references
      0 references
      29 September 2017
      0 references
      The author proposes and analyzes a heuristic rule of Hanke-Raus type for choosing a proper stopping criterion in the augmented Lagrangian method for solving linear inverse problems with a convex penalty. The main feature of the method is that it does not require a knowledge of the noise level. A posteriori estimates are derived under certain source type conditions and also the convergence is shown under certain conditions on the noise. The paper also includes some numerical results to illustrate the method for a linear integral equation of the first kind and a comparative study with the discrepancy principle.
      0 references
      0 references
      augmented Lagrangian method
      0 references
      iterative regularization
      0 references
      parameter choice
      0 references
      Hanke-Raus rule
      0 references
      error estimates
      0 references
      convex penalty
      0 references
      numerical result
      0 references
      linear integral equation
      0 references
      discrepancy principle
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

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