{'fraction_non_alphanumeric': 0.013268998793727383, 'fraction_numerical': 0.0, 'mean_word_length': 5.916666666666667, '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}}
Hybrid Algorithms with Index Addition and Subtraction Strategies for Solving Mathematical Programs with Complementarity Constraints

Recently, the authors have presented a hybrid approach for solving mathematical programs with complementarity constraints. This approach employs an active-set identification function and possesses a finite termination property under some appropriate conditions including the so-called asymptotically weak nondegeneracy. In this paper, we continue this work and propose two modified methods, one of which makes use of an index addition strategy and the other utilizes the converse strategy. Both the methods do not require the above-mentioned assumption and also have a finite termination property under very weak assumptions. Numerical experience shows that the proposed approaches are effective.