The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems

A noninterior path-following algorithm is proposed for the linear complementarity problem. The method employs smoothing techniques introduced by Kanzow. If the LCP is P0 + R0 and satisfies a nondegeneracy condition due to Fukushima, Luo, and Pang, then the algorithm is globally linearly convergent. As with interior point path-following methods, the convergence theory relies on the notion of a neighborhood for the central path. However, the choice of neighborhood differs significantly from that which appears in the interior point literature. Numerical experiments are presented that illustrate the significance of the neighborhood concept for this class of methods.

[1]  Yahya FATHI,et al.  Computational complexity of LCPs associated with positive definite symmetric matrices , 1979, Math. Program..

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

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

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

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

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

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

[8]  Christian Kanzow,et al.  On the resolution of monotone complementarity problems , 1996, Comput. Optim. Appl..

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

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

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

[12]  James V. Burke,et al.  A polynomial time interior–point path–following algorithm for LCP based on Chen–Harker–Kanzow smoothing techniques , 1999, Math. Program..

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

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

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