{'fraction_non_alphanumeric': 0.015151515151515152, 'fraction_numerical': 0.0, 'mean_word_length': 4.8544303797468356, '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}}
On Locating All Local Minima of Multidimensional Function for Box Constrained

A novel method of locating all local minima of a function is presented here. Among many methods that exist in global optimization literature, Multi-start and Min-finder are effective methods because of their ability to locate not only the global minimum but also all local minima of the objective function. Both of these methods have the disadvantage of high computational cost. To remedy this, we propose a quality measure called G-measure to measure the local minima of a multidimensional continuous and differentiable function distribution inside a bounded domain. The proposed algorithm greatly reduces the frequency of the local optimal search, and it does not make use of a priori knowledge of the number of local minima. We compare the performance of this new method with that of Multi-start and Min-finder on a set of benchmark problems.