{'fraction_non_alphanumeric': 0.015126050420168067, 'fraction_numerical': 0.0, 'mean_word_length': 5.478260869565218, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Convergence analysis of an inexact iteratively regularized Gauss-Newton method under general source conditions

In this paper we improve existing convergence and convergence rate results for the iteratively regularized Gauss-Newton method in two respects: First we show optimal rates of convergence under general source conditions, and second we assume that the linearized equations are solved only approximately in each Newton step. The latter point is important for large scale problems where the linearized equation can often only be solved iteratively, e.g. by the conjugate gradient method.