Computational Methods for Inverse Problems (Q4779914)

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 1821336
Language Label Description Also known as
default for all languages
No label defined
    English
    Computational Methods for Inverse Problems
    scientific article; zbMATH DE number 1821336

      Statements

      Computational Methods for Inverse Problems (English)
      0 references
      29 October 2002
      0 references
      textbook
      0 references
      steepest descent method
      0 references
      positivity constraints
      0 references
      inverse problems
      0 references
      convolution integral equations
      0 references
      optimization methods
      0 references
      Tikhonov regularization
      0 references
      gradient methods
      0 references
      Newton's method
      0 references
      line search
      0 references
      estimation methods
      0 references
      image reconstruction
      0 references
      identification
      0 references
      regularization parameter
      0 references
      0 references
      This book introduces to techniques for solving inverse problems formulated as convolution integral equations which are then discretized. The first chapters are standard. They introduce to the topic, present analytical tools (regularization theory, optimization methods, the method of Tikhonov regularization), numerical ones (steepest descent method, gradient methods, Newton's method, line search) and statistical ones (various usual estimation methods). The statistical and optimization methods are brought together (an originality of this monograph) for a problem of image reconstruction in dimension two. A next chapter comes back to general methods in identification and some more elaborate nonlinear optimization algorithms are quickly presented. A way of selecting a regularization parameter in a statistical context is the topic of chapter seven. In chapter eight the optimization cost contains a term involving the total variation of a function. This helps preserving the blocky structure of an image (in an image reconstruction problem). Positivity constraints are included in the last chapter.
      0 references

      Identifiers

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