{'fraction_non_alphanumeric': 0.009831460674157303, 'fraction_numerical': 0.0, 'mean_word_length': 5.663551401869159, '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 hybrid conjugate gradient method with sufficient descent property for unconstrained optimization

In order to take advantage of the strong theoretical properties of the FR method and computational efficiency of the method, we present a new hybrid conjugate gradient method based on the convex combination of these methods. In our method, the search directions satisfy the sufficient descent condition independent of any line search. Under some standard assumptions, we established global convergence property of our proposed method for general functions. Numerical comparisons on some test problems from the CUTEst library illustrate the efficiency and robustness of our proposed method in practice.