The global linear convergence of a noninterior path-following algorithm for linear complementarity problems

Mathematics of Operations Research

Volumn 23, Issue 3, 1998, Pages 719-734

  Burke, James V ^a   Xu, Song ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Global linear convergence; Interior point algorithm; Linear complementarity problem; Noninterior algorithm; Path following algorithm

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; LINEAR PROGRAMMING; PROBLEM SOLVING;

GLOBAL LINEAR CONVERGENCE; LINEAR COMPLEMENTARITY PROBLEM; NONINTERIOR ALGORITHM; PATH FOLLOWING ALGORITHM;

OPERATIONS RESEARCH;

EID: 0032131487     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.23.3.719     Document Type: Article

References (21)

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