A polynomial time interior–point path–following algorithm for LCP based on Chen–Harker–Kanzow smoothing techniques

$$O\sqrt{n}L$$); otherwise, the complexity bound is O(nL). The relations between our search direction and the one used in the standard interior-point algorithm are also discussed.

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

[2]  Song Xu,et al.  The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform P-functions , 2000, Math. Program..

[3]  Yin Zhang,et al.  On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem , 1994, SIAM J. Optim..

[4]  James V. Burke,et al.  The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems , 1998, Math. Oper. Res..

[5]  Francisco Facchinei,et al.  A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm , 1997, SIAM J. Optim..

[6]  Keisuke Hotta,et al.  Global convergence of a class of non-interior point algorithms using Chen-Harker-Kanzow-Smale functions for nonlinear complementarity problems , 1999, Math. Program..

[7]  A. Fischer.  A special newton-type optimization method , 1992 .

[8]  Fischer Andreas.  On the local superlinear convergence of a Newton-type method for LCP under weak conditions , 1995 .

[9]  V. Rich.  Personal communication , 1989, Nature.

[10]  Xiaojun Chen,et al.  A Global Linear and Local Quadratic Continuation Smoothing Method for Variational Inequalities with Box Constraints , 2000, Comput. Optim. Appl..

[11]  J. J. Moré,et al.  Smoothing of mixed complementarity problems , 1995 .

[12]  Jong-Shi Pang,et al.  Newton's Method for B-Differentiable Equations , 1990, Math. Oper. Res..

[13]  Masao Fukushima,et al.  A Globally Convergent Sequential Quadratic Programming Algorithm for Mathematical Programs with Linear Complementarity Constraints , 1998, Comput. Optim. Appl..

[14]  P. TsengyJune.  Simpliied Analysis of an O(nl)-iteration Infeasible Predictor-corrector Path-following Method for Monotone Lcp , 1994 .

[15]  Stephen J. Wright.  A path-following infeasible-interior-point algorithm for linear complementarity problems , 1993 .

[16]  João Soares,et al.  Testing a New Class of Algorithms for Nonlinear Complementarity Problems , 1995 .

[17]  A. Fischer.  An NCP–Function and its Use for the Solution of Complementarity Problems , 1995 .

[18]  A. Fischer.  A Newton-type method for positive-semidefinite linear complementarity problems , 1995 .

[19]  Christian Kanzow,et al.  A continuation method for (strongly) monotone variational inequalities , 1998, Math. Program..

[20]  Francisco Facchinei,et al.  A semismooth equation approach to the solution of nonlinear complementarity problems , 1996, Math. Program..

[21]  Bintong Chen,et al.  A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen-Mangasarian Smoothing Functions , 1999, SIAM J. Optim..

[22]  P. Tseng.  Growth behavior of a class of merit functions for the nonlinear complementarity problem , 1996 .

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

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

[25]  Francisco Facchinei,et al.  A smoothing method for mathematical programs with equilibrium constraints , 1999, Math. Program..

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

[27]  Xiaojun ChenyMay.  A Global and Local Superlinear Continuation-Smoothing Method for P0 +R0 and Monotone NCP , 1997 .

[28]  Olvi L. Mangasarian,et al.  A class of smoothing functions for nonlinear and mixed complementarity problems , 1996, Comput. Optim. Appl..

[29]  Christian Kanzow,et al.  Global Convergence Properties of Some Iterative Methods for Linear Complementarity Problems , 1996, SIAM J. Optim..

[30]  Bintong Chen,et al.  A Non-Interior-Point Continuation Method for Linear Complementarity Problems , 1993, SIAM J. Matrix Anal. Appl..

[31]  Christian Kanzow,et al.  Some Noninterior Continuation Methods for Linear Complementarity Problems , 1996, SIAM J. Matrix Anal. Appl..

[32]  Jong-Shi Pang,et al.  A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems , 1991, Math. Program..