Goal oriented adaptivity in the IRGNM for parameter identification in PDEs: I. Reduced formulation

DOI10.1088/0266-5611/30/4/045001MaRDI QIDQ5418604zbMATH OpenOpenAlexFDO

Authors Barbara Kaltenbacher, Alana Kirchner, Slobodan Veljović

Publication date 26 May 2014

Published in Inverse Problems (Search for Journal in Brave)

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

zbMATH Keywords

a posteriori parameter choicea priori parameter choiceadaptive discretizationBanach spaceBregman distanceconvergence ratediscrepancy principleHilbert spaceill-posed probleminverse problemiteratively regularized Gauss-Newton methodparameter identificationsource condition

Mathematics Subject Classification ID

Inverse problems for PDEs (35R30) Nonlinear ill-posed problems (47J06) Numerical solutions to equations with nonlinear operators (65J15) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical solution to inverse problems in abstract spaces (65J22) Numerical methods for ill-posed problems for boundary value problems involving PDEs (65N20) Numerical methods for inverse problems for boundary value problems involving PDEs (65N21)

Abstract: In this paper we study adaptive discretization of the iteratively regularized Gauss-Newton method IRGNM with an a posteriori (discrepancy principle) choice of the regularization parameter in each Newton step and of the stopping index. We first of all prove convergence and convergence rates under some accuracy requirements formulated in terms of four quantities of interest. Then computation of error estimators for these quantities based on a weighted dual residual method is discussed, which results in an algorithm for adaptive refinement. Finally we extend the results from the Hilbert space setting with quadratic penalty to Banach spaces and general Tikhonov functionals for the regularization of each Newton step.

Recommendations

• Goal oriented adaptivity in the IRGNM for parameter identification in PDEs. II: All-at-once formulations
• Convergence analysis of an inexact iteratively regularized Gauss-Newton method under general source conditions
• On the iteratively regularized Gauss-Newton method in Banach spaces with applications to parameter identification problems
• Convergence rates for the iteratively regularized Gauss-Newton method in Banach spaces
• Convergence and adaptive discretization of the IRGNM Tikhonov and the IRGNM Ivanov method under a tangential cone condition in Banach space

Cited in

(7)

• Convergence and adaptive discretization of the IRGNM Tikhonov and the IRGNM Ivanov method under a tangential cone condition in Banach space
• The Ivanov regularized Gauss-Newton method in Banach space with an a posteriori choice of the regularization radius
• Goal oriented adaptivity in the IRGNM for parameter identification in PDEs. II: All-at-once formulations
• Efficient computation of the Tikhonov regularization parameter by goal-oriented adaptive discretization
• On a Dynamic Variant of the Iteratively Regularized Gauss–Newton Method with Sequential Data
• Adaptive reduced basis trust region methods for parabolic inverse problems
• Adaptive approximations of inclusions in a semilinear elliptic problem related to cardiac electrophysiology

This page was built for publication: Goal oriented adaptivity in the IRGNM for parameter identification in PDEs: I. Reduced formulation

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