{'fraction_non_alphanumeric': 0.016414141414141416, 'fraction_numerical': 0.0, 'mean_word_length': 5.895652173913043, '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 Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition

Some interior-point algorithms have superlinear convergence. When solving an LCP linear complementarity problem, superlinear convergence had been achieved under the assumption that a strictly complementary solution exists, whether starting from a feasible or an infeasible interior point. In this paper, we propose an algorithm for solving monotone geometrical LCPs, and we prove its superlinear convergence without the strictly complementary condition. The algorithm can start from an infeasible interior point and has globally linear convergence. When we use a big initial point or an almost feasible initial point, the algorithm has polynomial time convergence.