{'fraction_non_alphanumeric': 0.01585014409221902, 'fraction_numerical': 0.0, 'mean_word_length': 5.318181818181818, '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}}
A convergence analysis of iterative methods for the solution of nonlinear ill-posed problems under affinely invariant conditions

For iterative methods for well-posed problems, invariance properties have been used to provide a unified framework for convergence analysis. We carry over this approach to iterative methods for nonlinear ill-posed problems and prove convergence with rates for the Landweber and the iteratively regularized Gauss-Newton methods. The conditions needed are weaker as far as the nonlinearity is concerned than those needed in earlier papers and apply also to severely ill-posed problems. With no additional effort, we can also treat multilevel versions of our methods.