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

References

• Chen B., Chen X. A global linear and local quadratic continuation method for variational inequalities with box constraints. (1997a) . Preprint, Department of Management and Systems, Washington State University, Pullman, WA 99164-4736Google Scholar
• Chen B., Chen X. A global and local super-linear continuation method for P0 + R0 and monotone NCP. (1997b) . Preprint, Department of Management and Systems, Washington State University, Pullman, WA 99164–4736Google Scholar
• Chen B., Harker P. T. A non-interior-point continuation method for linear complementarity problems. SIAM J. Matrix Anal. Appl. (1993) 14:1168–1190Crossref, Google Scholar
• Chen B., Xiu N. A global linear and local quadratic non-interior continuation method for nonlinear complementarity problems based on Chen-Mangasarian smoothing functions. (1997) . Preprint, Department of Management and Systems, Washington State University, Pullman, WA 99164-4736Google Scholar
• Fathi Y. Computational complexity of LCPs associated with positive definite matrices. Math. Programming (1979) 17:335–344Crossref, Google Scholar
• Fukushima M., Luo Z.-Q., Pang J.-S. A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints. Comput. Optim. Appl. (1996) . To appear inGoogle Scholar
• Geiger C., Kanzow C. On the resolution of monotone complementarity problems. Comput. Optim. Appl. (1996) 5:155–173Crossref, Google Scholar
• Harker P. T., Pang J.-S., Allgower E., Georg K. A damped Newton method for the linear complementarity problem. Lectures in Applied Mathematics (1990) 26(AMS, Providence, RI) 265–284Google Scholar
• Hotta K., Yoshise A. Global convergence of a class of non-interior-point algorithms using Chen-Harker-Kanzow functions for nonlinear complementarity problems. (1996) . Discussion paper series, no. 708, University of Tsukuba, Tsukuba, Ibaraki 305, JapanGoogle Scholar
• Jones C., Gowda M. S. On the connectedness of solution sets in linear complementarity problems. (1997) . Technical report number TR97-01, Department of Mathematics and Statistics, University of Maryland Baltimore County, Baltimore, MD 21520Google Scholar
• Kanzow C. An unconstrained optimization technique for large-scale linearly constrained convex minimization problems. Computing (1994) 53:101–117Crossref, Google Scholar
• Kanzow C. Some noninterior continuation methods for linear complementarity problems. SIAM J. Matrix Anal. Appl. (1996) 17:851–868Crossref, Google Scholar
• Kojima C., Meggido N., Noma T., Yoshise A.A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems (1991) (Springer-Verlag, Berlin) Crossref, Google Scholar
• Murty K. G.Linear Complementarity, Linear and Nonlinear Programming (1988) (Heldermann, Berlin) . Sigma Series in Applied Mathematics 3Google Scholar
• Qi L. Convergence analysis of some algorithms for solving nonsmooth equations. Math. Oper. Res. (1993) 18:227–244Link, Google Scholar
• Qi L., Sun D. Globally linearly, and globally and locally superlinearly convergent versions of the Hotta-Yoshise non-interior point algorithm for nonlinear complementarity problems. (1997) . Applied Mathematics Report, School of Mathematics University of New South Wales, Sydney 2052, AustraliaGoogle Scholar
• Tseng P., Agarwal R. Simplified analysis of an O(nL)-iteration infeasible predictor-corrector path-following method for monotone LCP. Recent Trends in Optimization Theory and Applications (1994) (World Scientific Press, Singapore) 423–434Google Scholar
• Xu S. The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform P-functions. (1996) . Technical report, Department of Mathematics, University of Washington, Seattle, WA 98195Google Scholar
• Xu S. The global linear convergence and complexity of a non-interior path-following algorithm for monotone LCP based on Chen-Harker-Kanzow-Smale smoothing function. (1997) . Technical report, Department of Mathematics, University of Washington, Seattle, WA 98195Google Scholar
• Xu S., Burke J. V. A polynomial time interior point path-following algorithm for LCP based on Chen-Harker-Kanzow smoothing techniques. Math. Programming (1996) . To appear inGoogle Scholar
• Zhang Y. On the convergence of a class of infeasible interior point algorithms for the horizontal linear complementarity problem. SIAM J. Optim. (1994) 4:208–227Crossref, Google Scholar