Convergence and application of a modified iteratively regularized Gauss-Newton algorithm

Alexandra Smirnova, Rosemary Renaut, Taufiquar Khan

Research output: Contribution to journalArticle

15 Scopus citations

Abstract

Theoretical convergence results for an iteratively regularized Gauss-Newton (IRGN) algorithm with a Tikhonov regularization term using a seminorm generated by a linear operator are established. The convergence theorem uses an a posteriori stopping rule and a modified source condition, without any restriction on the nonlinearity of the operator. The theoretical results are illustrated by simulations for a one-dimensional version of the exponentially ill-posed optical tomography inverse problem for the diffusion (D) and absorption (μ) coefficient spatial distributions. The modified Tikhonov regularization performs the mapping of the minimization variables, which are the coefficients of the spline expansions for D and μ, to physical space. This incorporates the inherently differing scales of these variables in the minimization, and also suggests relative weighting of the regularization terms with respect to each parameter space. The presented modification of the IRGN allows greater flexibility for implementations of IRGN solutions of ill-posed inverse problems in which differing scales in physical space hinder standard IRGN inversions.

Original languageEnglish (US)
Article number011
Pages (from-to)1547-1563
Number of pages17
JournalInverse Problems
Volume23
Issue number4
DOIs
StatePublished - Aug 1 2007

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Mathematical Physics
  • Computer Science Applications
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Convergence and application of a modified iteratively regularized Gauss-Newton algorithm'. Together they form a unique fingerprint.

  • Cite this