On the discrepancy principle for some Newton type methods for solving nonlinear inverse problems

DOI10.1007/S00211-008-0198-YzbMATH Open1253.65087arXiv0810.4185OpenAlexW2104657059MaRDI QIDQ1006845FDOQ1006845

Authors: Ulrich Tautenhahn, Qinian Jin 

Publication date: 26 March 2009

Published in: Numerische Mathematik (Search for Journal in Brave)

Abstract: We consider the computation of stable approximations to the exact solution $x^{d}ag$ of nonlinear ill-posed inverse problems $F(x)=y$ with nonlinear operators $F:XoY$ between two Hilbert spaces $X$ and $Y$ by the Newton type methods ${\displaystyle }$ x_{k+1}^delta=x_0-g_{alpha_k} (F'(x_k^delta)^*F'(x_k^delta)) F'(x_k^delta)^* (F(x_k^delta)-y^delta-F'(x_k^delta)(x_k^delta-x_0)) ${\displaystyle }$ in the case that only available data is a noise $y^{d}elta$ of $y$ satisfying $|y^{d}elta-y|ledelta$ with a given small noise level $delta>0$. We terminate the iteration by the discrepancy principle in which the stopping index $k_{d}elta$ is determined as the first integer such that ${\displaystyle }$ |F(x_{k_delta}^delta)-y^delta|le au delta <|F(x_k^delta)-y^delta|, qquad 0le k<k_delta ${\displaystyle }$ with a given number $au>1$. Under certain conditions on $alph{a}_k$, $g_{a}lpha$ and $F$, we prove that $x_{k_{d}elta}^{d}elta$ converges to $x^{d}ag$ as $deltao0$ and establish various order optimal convergence rate results. It is remarkable that we even can show the order optimality under merely the Lipschitz condition on the Fr'{e}chet derivative $F^{\prime }$ of $F$ if $x_0-x^{d}ag$ is smooth enough.

Full work available at URL: https://arxiv.org/abs/0810.4185

Recommendations

• A general convergence analysis of some Newton-type methods for nonlinear inverse problems
• ON APPLICATION OF GENERALIZED DISCREPANCY PRINCIPLE TO ITERATIVE METHODS FOR NONLINEAR ILL-POSED PROBLEMS
• Further convergence results on the general iteratively regularized Gauss-Newton methods under the discrepancy principle
• On the regularization of nonlinear ill-posed problems via inexact Newton iterations
• On convergence of regularized modified Newton's method for nonlinear ill-posed problems

Mathematics Subject Classification ID

Nonlinear ill-posed problems (47J06) Numerical solutions to equations with nonlinear operators (65J15) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)

Cites Work

• On a general regularization scheme for nonlinear ill-posed problems
• Iterative regularization methods for nonlinear ill-posed problems
• A convergence analysis of the Landweber iteration for nonlinear ill-posed problems
• On convergence rates of inexact Newton regularizations
• A regularizing Levenberg - Marquardt scheme, with applications to inverse groundwater filtration problems
• Regularization of ill-posed problems by stochastic iteration procedures in the mean
• On the regularization of nonlinear ill-posed problems via inexact Newton iterations
• Regularizing properties of a truncated newton-cg algorithm for nonlinear inverse problems
• Optimal a Posteriori Parameter Choice for Tikhonov Regularization for Solving Nonlinear Ill-Posed Problems
• Tikhonov regularization anda posteriorirules for solving nonlinear ill posed problems
• On convergence rates for the iteratively regularized Gauss-newton method
• Logarithmic convergence rates of the iteratively regularized Gauss - Newton method for an inverse potential and an inverse scattering problem
• A Lepskij-type stopping rule for regularized Newton methods
• A convergence analysis of the iteratively regularized Gauss–Newton method under the Lipschitz condition
• A convergence analysis of iterative methods for the solution of nonlinear ill-posed problems under affinely invariant conditions
• On the iteratively regularized Gauss-Newton method for solving nonlinear ill-posed problems
• On an a posteriori parameter choice strategy for Tikhonov regularization of nonlinear ill-posed problems
• Some Newton-type methods for the regularization of nonlinear ill-posed problems
• A posteriori parameter choice strategies for some Newton type methods for the regularization of nonlinear ill-posed problems

Cited In (40)

• Title not available (Why is that?)
• Error estimates of some Newton-type methods for solving nonlinear inverse problems in Hilbert scales
• Convergence analysis of iteratively regularized Gauss-Newton method with frozen derivative in Banach spaces
• Solving nonlinear inverse problems by evolution equations based on Gauss–Newton methods
• A note on the minimization of a Tikhonov functional with \(\ell^1\)-penalty
• Comparing parameter choice methods for regularization of ill-posed problems
• Convergence rates for iteratively regularized Gauss-Newton method subject to stability constraints
• Dynamical systems method (DSM) for solving equations with monotone operators without smoothness assumptions on \(F{^{\prime}}(u)\)
• Simplified Levenberg–Marquardt method in Banach spaces for nonlinear ill-posed operator equations
• Simplified REGINN-IT method in Banach spaces for nonlinear ill-posed operator equations
• The regularizing Levenberg-Marquardt scheme is of optimal order
• Simplified Levenberg-Marquardt method in Hilbert spaces
• Analysis of a heuristic rule for the IRGNM in Banach spaces with convex regularization terms
• Nesterov’s accelerated gradient method for nonlinear ill-posed problems with a locally convex residual functional
• ON APPLICATION OF GENERALIZED DISCREPANCY PRINCIPLE TO ITERATIVE METHODS FOR NONLINEAR ILL-POSED PROBLEMS
• Levenberg-Marquardt method in Banach spaces with general convex regularization terms
• On application of asymptotic generalized discrepancy principle to the analysis of epidemiology models
• Simplified generalized Gauss-Newton method for nonlinear ill-posed operator equations in Hilbert scales
• Fast fully iterative Newton-type methods for inverse problems
• Title not available (Why is that?)
• Dynamical systems method of gradient type for solving nonlinear equations with monotone operators
• Towards a general convergence theory for inexact Newton regularizations
• Iterative Lavrentiev regularization method under a heuristic rule for nonlinear ill-posed operator equations
• Convergence analysis of simplified iteratively regularized Gauss–Newton method in a Banach space setting
• Analysis of the iteratively regularized Gauss–Newton method under a heuristic rule
• A generalization of continuous regularized Gauss-Newton method for ill-posed problems
• Error estimates for the simplified iteratively regularized Gauss-Newton method under a general source condition
• On a regularized Levenberg-Marquardt method for solving nonlinear inverse problems
• A general convergence analysis of some Newton-type methods for nonlinear inverse problems
• Modified Iterative Runge-Kutta-Type Methods for Nonlinear Ill-Posed Problems
• Inexact Newton regularization combined with two-point gradient methods for nonlinear ill-posed problems
• Convergence analysis of simplified Gauss–Newton iterative method under a heuristic rule
• On a class of frozen regularized Gauss-Newton methods for nonlinear inverse problems
• On the second-order asymptotical regularization of linear ill-posed inverse problems
• Further convergence results on the general iteratively regularized Gauss-Newton methods under the discrepancy principle
• On the iteratively regularized Gauss-Newton method in Banach spaces with applications to parameter identification problems
• On the convergence of a regularizing Levenberg-Marquardt scheme for nonlinear ill-posed problems
• Convergence analysis of a two-point gradient method for nonlinear ill-posed problems
• A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems
• Simplified generalized Gauss-Newton iterative method under Morozove type stopping rule

This page was built for publication: On the discrepancy principle for some Newton type methods for solving nonlinear inverse problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006845)