{'fraction_non_alphanumeric': 0.011918951132300357, 'fraction_numerical': 0.0, 'mean_word_length': 5.412213740458015, '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 note on Minty type vector variational inequalities

The existence of solutions to a scalar Minty variational inequality of differential type is usually related to monotonicity property of the primitive function. On the other hand, solutions of the variational inequality are global minimizers for the primitive function.
 The present paper generalizes these results to vector variational inequalities
 putting the Increasing Along Rays (IAR) property into the center of the discussion. To achieve that infinite elements in the image space Y are introduced.
 Under quasiconvexity assumptions we show that solutions of generalized variational inequality and of the primitive optimization problem are equivalent.
 Finally, we discuss the possibility to generalize the scheme of this paper to get further applications in vector optimization.