An O(root nL) iteration primal-dual path-following method, based on wide neighborhoods and large updates, for monotone LCP

摘要

In this paper we propose a new class of primal-dual path-following interior point algorithms for solving monotone linear complementarity problems. At each iteration, the method would select a target on the central path with a large update from the current iterate, and then the Newton method is used to get the search directions, followed by adaptively choosing the step sizes, which are, e. g., the largest possible steps before leaving a neighborhood that is as wide as the N-infinity(-) neighborhood. The only deviation from the classical approach is that we treat the classical Newton direction as the sum of two other directions, corresponding to, respectively, the negative part and the positive part of the right-hand side. We show that if these two directions are equipped with different and appropriate step sizes, then the method enjoys the low iteration bound of O(root n log L), where n is the dimension of the problem and L = ((x0)T epsilon)/(epsilon) with epsilon the required precision and (x(0), s(0)), the initial interior solution. For a predictor-corrector variant of the method, we further prove that, besides the predictor steps, each corrector step also reduces the duality gap by a rate of 1-1/O(root n). Additionally, if the problem has a strict complementary solution, then the predictor steps converge Q-quadratically.