English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

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.

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