NANAOct 17, 2010

A general convergence analysis on inexact Newton method for nonlinear inverse problems

arXiv:1010.3435h-index: 24
Originality Synthesis-oriented
AI Analysis

For researchers working on nonlinear inverse problems, this work offers a unified theoretical framework for a broad class of spectral filter methods, though it is an incremental extension of existing convergence theories.

The paper provides a general convergence analysis for inexact Newton methods applied to nonlinear ill-posed inverse problems with noisy data, proving convergence and optimal convergence rates under Hölder source conditions.

We consider the inexact Newton methods $$ x_{n+1}^\d=x_n^\d-g_{\a_n}(F'(x_n^\d)^* F'(x_n^\d)) F'(x_n^\d)^* (F(x_n^\d)-y^\d) $$ for solving nonlinear ill-posed inverse problems $F(x)=y$ using the only available noise data $y^\d$ satisfying $\|y^\d-y\|\le \d$ with a given small noise level $\d>0$. We terminate the iteration by the discrepancy principle $$ \|F(x_{n_\d}^\d)-y^\d\|\le τ\d<\|F(x_n^\d)-y^\d\|, \qquad 0\le n<n_\d $$ with a given number $τ>1$. Under certain conditions on $\{\a_n\}$ and $F$, we prove for a large class of spectral filter functions $\{g_\a\}$ the convergence of $x_{n_\d}^\d$ to a true solution as $\d\rightarrow 0$. Moreover, we derive the order optimal rates of convergence when certain Hölder source conditions hold. Numerical examples are given to test the theoretical results.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes