{'fraction_non_alphanumeric': 0.022172949002217297, 'fraction_numerical': 0.0, 'mean_word_length': 5.953846153846154, '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 New Type Method for the Structured Variational Inequalities Problem

In this paper, we present an algorithm for solving the structured variational inequality problem, and prove the global convergence of the new method without carrying out any line search technique, and the global R-convergence rate are also given under the suitable conditions. Keywords—structured variational inequality problem; algorithm; globally convergent; R-linear convergent