Home Mathematics On convergence rates for iteratively regularized Newton-type methods under a Lipschitz-type nonlinearity condition
Article
Licensed
Unlicensed Requires Authentication

On convergence rates for iteratively regularized Newton-type methods under a Lipschitz-type nonlinearity condition

  • Frank Werner EMAIL logo
Published/Copyright: March 22, 2014

Abstract

We investigate a generalization of the well-known iteratively regularized Gauss–Newton method where the Newton equations are regularized variationally using general data fidelity and penalty terms. To obtain convergence rates, we use a general error assumption which has recently been shown to be useful for impulsive and Poisson noise. We restrict the nonlinearity of the forward operator only by a Lipschitz-type condition and compare our results to other convergence rates results proven in the literature. Finally we explicitly state our convergence rates for the aforementioned case of Poisson noise to shed some light on the structure of the posed error assumption.

MSC: 65J15; 65J20

Funding source: DFG

Award Identifier / Grant number: SFB 755

Funding source: DFG

Award Identifier / Grant number: Research Training Group 1023

Received: 2013-11-29
Revised: 2013-12-16
Accepted: 2014-2-1
Published Online: 2014-3-22
Published in Print: 2015-2-1

© 2015 by De Gruyter

Downloaded on 8.12.2025 from https://www.degruyterbrill.com/document/doi/10.1515/jiip-2013-0074/pdf
Scroll to top button