A non–interior predictor–corrector path following algorithm for the monotone linear complementarity problem

Abstract.We present a predictor–corrector non–interior path following algorithm for the monotone linear complementarity problem based on Chen–Harker–Kanzow–Smale smoothing techniques. Although the method is modeled on the interior point predictor–corrector strategies, it is the first instance of a non–interior point predictor–corrector algorithm. The algorithm is shown to be both globally linearly convergent and locally quadratically convergent under standard hypotheses. The approach to global linear convergence follows the authors’ previous work on this problem for the case of (P0+R0) LCPs. However, in this paper we use monotonicity to refine our notion of neighborhood of the central path. The refined neighborhood allows us to establish the uniform boundedness of certain slices of the neighborhood of the central path under the standard hypothesis that a strictly positive feasible point exists.

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

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

[3]  M. Gowda,et al.  On the connectedness of solution sets in linear complementarity problems , 1998 .

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

[5]  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..

[6]  Stephen M. Robinson,et al.  Normal Maps Induced by Linear Transformations , 1992, Math. Oper. Res..

[7]  P. Tseng.  Analysis Of A Non-Interior Continuation Method Based On Chen-Mangasarian Smoothing Functions For Com , 1998 .

[8]  Liqun Qi,et al.  Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations , 1993, Math. Oper. Res..

[9]  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..

[10]  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..

[11]  Xiaojun Chen,et al.  A Global and Local Superlinear Continuation-Smoothing Method for P0 and R0 NCP or Monotone NCP , 1999, SIAM J. Optim..

[12]  Stephen J. Wright.  Primal-Dual Interior-Point Methods , 1997, Other Titles in Applied Mathematics.

[13]  Shinji Mizuno,et al.  On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming , 1993, Math. Oper. Res..

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

[15]  Defeng Sun,et al.  A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities , 2000, Math. Program..

[16]  Xiaojun Chen,et al.  Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities , 1998, Math. Comput..

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

[18]  Paul Tseng,et al.  An Infeasible Path-Following Method for Monotone Complementarity Problems , 1997, SIAM J. Optim..

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

[20]  Y. Ye,et al.  On Homotopy-Smoothing Methods for Variational Inequalities , 1999 .