{'fraction_non_alphanumeric': 0.017543859649122806, 'fraction_numerical': 0.0014619883040935672, 'mean_word_length': 5.650485436893204, '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}}
An efficient adaptive three-term extension of the Hestenes–Stiefel conjugate gradient method

A new three-term Hestenes–Stiefel-type conjugate gradient method is proposed in which the search direction can satisfy the sufficient descent condition as well as an adaptive conjugacy condition. It is notable that search directions of the method are dynamically adjusted between that of the Newton method and the 3HS+ method, accelerating the convergence or reducing the condition number of iteration matrix. Under mild conditions, we show that the proposed method converges globally for general objective functions. Numerical experiments indicate that the method is practically promising.