Limiting behavior of the derivatives of certain trajectories associated with a monotone horizontal linear complementarity problem

Given a certain monotone horizontal linear complementarity problem HLCP, we can naturally construct a family of systems of nonlinear equations parametrized by a parameter t ∈ 0, 1] with the property that, as t tends to 0, the corresponding system “converges” to the HLCP. Under reasonable conditions, it has been shown that each system of the family has a unique solution and that, as t tends to 0, these solutions converge to a specific solution of the HLCP. The main purpose of this paper is to study the asymptotic behavior of the derivative of the trajectory of solutions and therefore obtain information on the way the trajectory approaches the solution set of the HLCP. We show that the trajectory of solutions converges to the solution set along a unique and well-characterized direction. Moreover, if the HLCP has a solution satisfying strict complementarity then the direction forms a definite angle with any face of the feasible region which contains the limit point; otherwise, the direction is tangent to some face of the feasible region.

[1]  Olvi L. Mangasarian,et al.  Error bounds for monotone linear complementarity problems , 1986, Math. Program..

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

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

[4]  Nimrod Megiddo,et al.  Boundary Behavior of Interior Point Algorithms in Linear Programming , 1989, Math. Oper. Res..

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

[6]  Renato D. C. Monteiro,et al.  Limiting behavior of the affine scaling continuous trajectories for linear programming problems , 1991, Math. Program..

[7]  Renato D. C. Monteiro,et al.  Convergence and Boundary Behavior of the Projective Scaling Trajectories for Linear Programming , 1991, Math. Oper. Res..

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

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

[10]  Shinji Mizuno,et al.  A General Framework of Continuation Methods for Complementarity Problems , 1993, Math. Oper. Res..

[11]  Sanjay Mehrotra,et al.  Quadratic Convergence in a Primal-Dual Method , 1993, Math. Oper. Res..

[12]  Osman Güler,et al.  Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems , 1993, Math. Oper. Res..

[13]  Yinyu Ye,et al.  On quadratic and $$O\left( {\sqrt {nL} } \right)$$ convergence of a predictor—corrector algorithm for LCP , 1993, Math. Program..

[14]  Yin Zhang,et al.  A quadratically convergent O( $$\sqrt n $$ L)-iteration algorithm for linear programming , 1993, Math. Program..

[15]  Osman Güler,et al.  Limiting behavior of weighted central paths in linear programming , 1994, Math. Program..

[16]  M. Todd,et al.  Reducing horizontal linear complementarity problems , 1995 .

[17]  T. Tsuchiya,et al.  Quadratic convergence of the Iri-Imai algorithm for degenerate linear programming problems , 1995 .

[18]  Osman Güler,et al.  Generalized Linear Complementarity Problems , 1995, Math. Oper. Res..

[19]  Takashi Tsuchiya,et al.  Superlinear convergence of the affine scaling algorithm , 1996, Math. Program..