{'fraction_non_alphanumeric': 0.023376623376623377, 'fraction_numerical': 0.0, 'mean_word_length': 4.676470588235294, '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}}
Global complexity bound of the Levenberg–Marquardt method

In this paper, we propose a new updating rule of the Levenberg–Marquardt (LM) parameter for the LM method for nonlinear equations. We show that the global complexity bound of the new LM algorithm is , that is, it requires at most iterations to derive the norm of the gradient of the merit function below the desired accuracy .