{'fraction_non_alphanumeric': 0.016227180527383367, 'fraction_numerical': 0.0, 'mean_word_length': 5.767123287671233, '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}}
New Filled Function Method for Non-smooth Constrained Global Optimization

New filled function method is developed in this paper, which is different from that of the traditional filled functions, to solve non-smooth constrained global optimization problem. Theoretical properties of the proposed function is investigated, and solution algorithm is proposed. Numerical experiments are also reported in this paper. The preliminary computational results show that the proposed method is promising