{'fraction_non_alphanumeric': 0.010014306151645207, 'fraction_numerical': 0.0, 'mean_word_length': 4.833333333333333, '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}}
An improved stochastic local search method in a multistart framework

UNIRANDI is a stochastic type, direct search method, where in each step a line search is started from the current point along a good random direction. In this paper we consider an improved version of this local search algorithm. The new method alters the random directions with new directions that rely on information from the previous stages of the optimization process. The improved algorithm was tested in a simple multistart framework and also as part of the GLOBAL method. The new local search technique is empirically compared with the old one on a unimodal and a multimodal function testbed up to moderate size dimensions.