Choice of parameters in the method of regularization of \(L\)-pseudoinversion (Q1405710)

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 1971404
Language Label Description Also known as
default for all languages
No label defined
    English
    Choice of parameters in the method of regularization of \(L\)-pseudoinversion
    scientific article; zbMATH DE number 1971404

      Statements

      Choice of parameters in the method of regularization of \(L\)-pseudoinversion (English)
      0 references
      0 references
      0 references
      31 August 2003
      0 references
      The authors investigate a regularization method for linearly constrained least squares problems which may be loosely described as finding, among all least squares solutions of given linear operator equation of the first kind involving a closed linear operator, a minimal norm least squares solution of another linear operator equation of the same kind. It is assumed that the two operators satisfy the so-called generalized complementarity condition -- essentially that the Cartesian product operator is bounded below. A regularized approximation to the solution of the optimization problem is obtained as a minimizer of a Tikhonov-like functional involving two parameters. A pair of discrepancy-like conditions is used to successively chose the two regularization parameters and the stability and convergence of the resulting method is proved.
      0 references
      Tikhonov regularization
      0 references
      linear equality constraints
      0 references
      parameter choice
      0 references
      least squares problems
      0 references
      linear operator equation of the first kind
      0 references
      minimal norm least squares solution
      0 references
      stability
      0 references
      convergence
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references