{'fraction_non_alphanumeric': 0.01793103448275862, 'fraction_numerical': 0.005517241379310344, 'mean_word_length': 5.722222222222222, '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}}
Modified Hager–Zhang conjugate gradient methods via singular value analysis for solving monotone nonlinear equations with convex constraint

Following a recent attempt by Waziri et al. [2019] to find an appropriate choice for the nonnegative parameter of the Hager–Zhang conjugate gradient method, we have proposed two adaptive options for the Hager–Zhang nonnegative parameter by analyzing the search direction matrix. We also used the proposed parameters with the projection technique to solve convex constraint monotone equations. Furthermore, the global convergence of the methods is proved using some proper assumptions. Finally, the efficacy of the proposed methods is demonstrated using a number of numerical examples.