All-at-once versus reduced iterative methods for time dependent inverse problems
From MaRDI portal
Abstract: In this paper we investigate all-at-once versus reduced regularization of dynamic inverse problems on finite time intervals . In doing so, we concentrate on iterative methods and nonlinear problems, since they have already been shown to exhibit considerable differences in their reduced and all-at-once versions, whereas Tikhonov regularization is basically the same in both settings. More precisely, we consider Landweber iteration, the iteratively regularized Gauss-Newton method, and the Landweber-Kaczmarz method, the latter relying on cyclic iteration over a subdivision of the problem into subsequent subintervals of . Part of the paper is devoted to providing an appropriate function space setting as well as establishing the required differentiability results needed for well-definedness and convergence of the methods under consideration. Based on this, we formulate and compare the above mentioned iterative methods in their all-at-once and their reduced version. Finally, we provide some convergence results in the framework of Hilbert space regularization theory and illustrate the convergence conditions by an example of an inverse source problem for a nonlinear diffusion equation.
Recommendations
- Regularization based on all-at-once formulations for inverse problems
- On Regularization Methods for Inverse Problems of Dynamic Type
- A reduced basis Landweber method for nonlinear inverse problems
- Efficient algorithms for the regularization of dynamic inverse problems: I. Theory
- An iterative method for an inverse source problem of time-fractional diffusion equation
Cited in
(23)- On numerical aspects of parameter identification for the Landau-Lifshitz-Gilbert equation in magnetic particle imaging
- Iterative regularization for constrained minimization formulations of nonlinear inverse problems
- Computational inverse problems for partial differential equations. Abstracts from the workshop held December 6--12, 2020 (hybrid meeting)
- Comparative analysis of gradient methods for source identification in a diffusion-logistic model
- The tangential cone condition for some coefficient identification model problems in parabolic PDEs
- Parameter identification for the Landau-Lifshitz-Gilbert equation in magnetic particle imaging
- Landweber–Kaczmarz for parameter identification in time-dependent inverse problems: all-at-once versus reduced version
- Preface: Dynamic inverse problems: modelling-regularization-numerics
- Discretization of parameter identification in PDEs using neural networks
- Parameter identification for elliptic boundary value problems: an abstract framework and applications
- Inverse problems with inexact forward operator: iterative regularization and application in dynamic imaging
- A model reference adaptive system approach for nonlinear online parameter identification
- Learning-informed parameter identification in nonlinear time-dependent PDEs
- Bi-level iterative regularization for inverse problems in nonlinear PDEs
- Ill-posedness of time-dependent inverse problems in Lebesgue-Bochner spaces
- One-shot learning of surrogates in PDE-constrained optimization under uncertainty
- Dynamic image reconstruction with motion priors in application to three dimensional magnetic particle imaging
- On the convergence analysis of one-shot inversion methods
- Regularization for time-dependent inverse problems: geometry of Lebesgue-Bochner spaces and algorithms
- Sequential bi-level regularized inversion with application to hidden reaction law discovery
- The ensemble Kalman filter for dynamic inverse problems
- The extended adjoint state and nonlinearity in correlation-based passive imaging
- On uniqueness of coefficient identification in the Bloch-Torrey equation for magnetic resonance imaging
This page was built for publication: All-at-once versus reduced iterative methods for time dependent inverse problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4978509)