{'fraction_non_alphanumeric': 0.009746588693957114, 'fraction_numerical': 0.0, 'mean_word_length': 6.23943661971831, '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 Novel monotonization Transformation for Some Classes of Global Optimization Problems

A novel monotonization method is proposed for converting a non-monotone programming problem into a monotone programming problem. An equivalent monotone programming problem with only inequality constraints is obtained via this monotonization method. Then the existing convexification and concavification methods can be used to convert the monotone programming problem into an equivalent better-structured optimization problem.