The iteratively regularized Gauss–Newton method with convex constraints and applications in 4Pi microscopy

DOI10.1088/0266-5611/28/1/015012zbMath1241.65054arXiv1106.5812OpenAlexW3103822957MaRDI QIDQ3224131

Thorsten Hohage, Robert Stück, Martin Burger

Publication date: 29 March 2012

Published in: Inverse Problems (Search for Journal in Brave)

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

zbMATH Keywords

convergenceinverse problemill-posed operator equationHilbert spacesGauss-Newton methodlinear Tikhonov regularizationNewton-type regularization method

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Linear operators and ill-posed problems, regularization (47A52)

Related Items (8)

Bayesian inverse problems with unknown operators ⋮ Iteratively regularized Newton-type methods for general data misfit functionals and applications to Poisson data ⋮ A Guide to the TV Zoo ⋮ Iterative Solution Methods ⋮ Identification of the exchange coefficient from indirect data for a coupled continuum pipe-flow model ⋮ An inverse problem involving a viscous eikonal equation with applications in electrophysiology ⋮ Improved inversion procedure for obtaining thermal properties of marine sediments via expansion of the temperature decay function ⋮ Modern regularization methods for inverse problems

This page was built for publication: The iteratively regularized Gauss–Newton method with convex constraints and applications in 4Pi microscopy