A General Framework of Continuation Methods for Complementarity Problems

A general class of continuation methods is presented which, in particular, solve linear complementarity problems with compositive-plus and L*-matrices. Let a, b ∈ Rn be nonnegative vectors. We embed the complementarity problem with a continuously differentiable mapping f: Rn → Rn in an artificial system of equations *   Fx, y = µa, I¶b and x, y ≥ 0, where F: R2n → R2n is defined by Fx, y = x1y1, ', xnyn, y-fx and µ ≥ 0 and I¶ ≥ 0 are parameters. A pair x, y is a solution of the complementarity problem if and only if it solves * for µ = 0 and I¶ = 0. A general idea of continuation methods founded on the system * is as follows: 1 Choose n-dimensional vectors a ≥ 0 and b > 0 such that the system * has a trivial solution x1, y1 for some µ1, I¶1 ≥ 0. 2 Trace solutions of * from x1, y1 with µ = µ1 and I¶ = I¶1 as the parameters µ and I¶ are decreased to zero. This idea provides a theoretical basis for various methods such as Lemke's method and a method of tracing the central trajectory of linear complementarity problems.

[1]  D. Gale,et al.  The Jacobian matrix and global univalence of mappings , 1965 .

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

[3]  Richaard W. Cottle Nonlinear Programs with Positively Bounded Jacobians , 1966 .

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

[5]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[6]  B. Curtis Eaves,et al.  On the basic theorem of complementarity , 1971, Math. Program..

[7]  B. Eaves The Linear Complementarity Problem , 1971 .

[8]  S. Karamardian,et al.  The complementarity problem , 1972, Math. Program..

[9]  Masakazu Kojima,et al.  A unification of the existence theorems of the nonlinear complementarity problem , 1975, Math. Program..

[10]  S. Karamardian An existence theorem for the complementarity problem , 1976 .

[11]  Herbert E. Scarf,et al.  The Solution of Systems of Piecewise Linear Equations , 1976, Math. Oper. Res..

[12]  Nimrod Megiddo,et al.  On the existence and uniqueness of solutions in nonlinear complementarity theory , 1977, Math. Program..

[13]  E. Allgower,et al.  Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations , 1980 .

[14]  M. Kojima An introduction to variable dimension algorithms for solving systems of equations , 1981 .

[15]  R. Kellogg,et al.  Pathways to solutions, fixed points, and equilibria , 1983 .

[16]  G. Sonnevend A New Method for Solving a Set of Linear (Convex) Inequalities and its Applications , 1986 .

[17]  G. Sonnevend An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming , 1986 .

[18]  G. Sonnevend A NEW METHOD FOR SOLVING A SET OF LINEAR (CONVEX) INEQUALITIES AND ITS APPLICATIONS , 1987 .

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

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

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

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

[23]  R. C. Monteiro,et al.  Interior path following primal-dual algorithms , 1988 .

[24]  Shinji Mizuno,et al.  A new continuation method for complementarity problems with uniformP-functions , 1989, Math. Program..

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

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

[27]  M. Gowda Pseudomonotone and copositive star matrices , 1989 .

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

[29]  Shinji Mizuno,et al.  Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems , 1990, Math. Oper. Res..

[30]  M. Seetharama Gowda,et al.  Generalized linear complementarity problems , 1990, Math. Program..

[31]  Eugene L. Allgower,et al.  Numerical continuation methods - an introduction , 1990, Springer series in computational mathematics.

[32]  Donald Goldfarb,et al.  An O(n3L) primal interior point algorithm for convex quadratic programming , 1991, Math. Program..

[33]  N. Megiddo,et al.  The Relation Between the Path of Centers and Smale's Regularization of the Linear Programming Problem , 1991 .

[34]  Nimrod Megiddo,et al.  Homotopy Continuation Methods for Nonlinear Complementarity Problems , 1991, Math. Oper. Res..

[35]  Nimrod Megiddo,et al.  A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems , 1991, Lecture Notes in Computer Science.

[36]  F. A. Karnes,et al.  Pathways to Solutions , 1993 .

[37]  Jong-Shi Pang,et al.  The basic theorem of complementarity revisited , 1993, Math. Program..