An O(n3L) adaptive path following algorithm for a linear complementarity problem

In this paper we propose an O(n3L) algorithm which is a modification of the path following algorithm [8] for a linear complementarity problem. The path following algorithm has to take a short step size in each iteration in order to bound the number of overall arithmetic operations by O(n3L). In practical computation, we can determine the step size adaptively. Mizuno, Yoshise, and Kikuchi [11] reported that such an adaptive algorithm required about O(L) iterations for some test problems. Here we show that we can use a rank one update technique in the adaptive algorithm so that the number of overall arithmetic operations is theoretically bounded by O(n3L).

[1]  N. Megiddo.  Pathways to the optimal set in linear programming , 1989 .

[2]  S. Mizuno.  O(nρL)-iteration and O(n3L)-operation potential reduction algorithms for linear programming , 1991 .

[3]  Shinji Mizuno,et al.  A polynomial-time algorithm for a class of linear complementarity problems , 1989, Math. Program..

[4]  S. Mizuno.  AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM , 1990 .

[5]  Shinji Mizuno,et al.  An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problems , 1991, Math. Program..

[6]  G. Dantzig,et al.  COMPLEMENTARY PIVOT THEORY OF MATHEMATICAL PROGRAMMING , 1968 .

[7]  M. Kojima,et al.  A primal-dual interior point algorithm for linear programming , 1988 .

[8]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[9]  C. E. Lemke,et al.  Bimatrix Equilibrium Points and Mathematical Programming , 1965 .

[10]  James Renegar,et al.  A polynomial-time algorithm, based on Newton's method, for linear programming , 1988, Math. Program..

[11]  Robert M. Freund,et al.  Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function , 1991, Math. Program..

[12]  Shinji Mizuno,et al.  A new polynomial time method for a linear complementarity problem , 1992, Math. Program..

[13]  S. Mizuno,et al.  PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS , 1989 .

[14]  Renato D. C. Monteiro,et al.  Interior path following primal-dual algorithms. part II: Convex quadratic programming , 1989, Math. Program..

[15]  Kurt M. Anstreicher,et al.  Long steps in an O(n3L) algorithm for linear programming , 1992, Math. Program..

[16]  C. C. Gonzaga,et al.  An Algorithm for Solving Linear Programming Problems in O(n 3 L) Operations , 1989 .

[17]  Renato D. C. Monteiro,et al.  Interior path following primal-dual algorithms. part I: Linear programming , 1989, Math. Program..

[18]  M. Todd,et al.  Recent Developments and New Directions in Linear Programming , 1988 .

[19]  Katta G. Murty,et al.  Linear complementarity, linear and nonlinear programming , 1988 .

[20]  Pravin M. Vaidya,et al.  An algorithm for linear programming which requires O(((m+n)n2+(m+n)1.5n)L) arithmetic operations , 1990, Math. Program..

[21]  C. C. Gonzaga,et al.  An algorithm for solving linear programming programs in O(n3L) operations , 1988 .

[22]  Yinyu Ye,et al.  An O(n3L) potential reduction algorithm for linear programming , 1991, Math. Program..