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

Mathematical Programming, Series B

Volumn 86, Issue 1, 1999, Pages 91-103

  Xu, Song ^a   Burke, James V ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Interior point method; Linear complementarity; Path following; Polynomial complexity

Indexed keywords

EID: 0002880324     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050081     Document Type: Article

References (35)

1. Burke, J., Xu, S. (1996): The global linear convergence of a non-interior path-following algorithm for linear complementarity problem. Preprint, Department of Mathematics, University of Washington, Seattle, WA 98195. December 1996
2. Chen, B. (1997): Personal communication. January 1997
3. Chen, B., Chen, X. (1997): 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. March 1997
4. 0 and monotone NCP. Preprint, Department of Management and Systems, Washington State University, Pullman, WA 99164-4736. May 1997. To appear in SIAM J. Optim.
5. Chen, B., Harker, P.T. (1993): A non-interior-point continuation method for linear complementarity problems. SIAM J. Matrix Anal. Appl. 14, 1168-1190
6. Chen, B., Xiu, N. (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. February 1997. To appear in SIAM J. Optim.
7. Chen, C., Mangasarian, O.L. (1996): A class of smoothing functions for nonlinear and mixed complementarity problems. Comput. Optim. Appl. 5, 97-138
8. De Luca, T., Facchinei, F., Kanzow, C. (1996): A semismooth equation approach to the solution of nonlinear complementarity problems. Math. Program. 75, 406-439
9. Facchinei, F., Jiang, H., Qi, L. (1996): A smoothing method for mathematical programs with equilibrium constraints. Preprint, School of Mathematis, University of New South Wales, Sydney, Australia. To appear in Math. Program.
10. Facchinei, F., Soares, J. (1995): Testing a new class of algorithms for nonlinear complementarity problems. In: Giannessi, F., Maugeri, A., eds., Variational Inequalities and Network Equilibrium Problems, pp. 69-83. Plenum Press, New York
11. Facchinei, F., Soares, J. (1997): A new merit function for nonlinear complementarity problems and a related algorithm. SIAM J. Optim. 7, 225-247
12. Fischer, A. (1992): A special Newton-type optimization method. Optimization 24, 269-284
13. Fischer, A. (1995): A Newton-type method for positive semi-definite linear complementarity problems. J. Optimization Theory Appl. 86, 585-608
14. Fischer, A. (1995): An NCP-function and its use for the solution of complementarity problems. In: Du, D.-Z., Qi, L., Womersley, R.S., eds., Recent Advances in Nonsmooth Optimization, pp. 88-105. World Scientific Publishers, Singapore
15. Fischer, A. (1995): On the local super-linear convergence of a Newton-type method for LCP under weak conditions. Optimization Methods Software 6, 83-107
16. Fukushima, M., Luo, Z.-Q., Pang, J.-S. (1998): A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints. Comput. Optim. Appl. 10, 5-34
17. Gabriel, S.A., Moré, J.J. (1997): Smoothing of mixed complementarity problems. In: Ferris, M.C., Pang, J.S., eds., Complementarity and Variational Problems: State of the Art, pp. 105-116. SIAM, Philadelphia, PA
18. Harker, P.T., Pang, J.-S. (1990): A damped Newton method for the linear complementarity problem. In: Allgower, E.L., Georg, K., eds., Computational Solution of Nonlinear Systems of Equations, pp. 265-284. Lectures in Applied Mathematics, Vol. 26, AMS, Providence, Rhode Island
19. Hotta, K., Yoshise, A. (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. December 1996. To appear in Math. Program.
20. Kanzow, C. (1996): Global convergence properties of some iterative methods for linear complementarity problems. SIAM J. Optim. 6, 326-341
21. Kanzow, C. (1996): Some noninterior continuation methods for linear complementarity problems. SIAM J. Matrix Anal. Appl. 17, 851-868
22. Kanzow, C., Jiang, H. (1998): A continuation method for (strongly) monotone variational inequalities. Math. Program. 81, 103-125
23. Kojima, M., Meggido, N., Noma, T., Yoshise, A. (1991): A unified approach to interior point algorithms for linear complementarity problems. Springer, Berlin
24. 3L) algorithm using a sequence for a linear complementarity problem. J. Oper. Res. Soc. Japan 33, 66-75
25. Mizuno, S. (1992): A new polynomial time method for a linear complementarity problem. Math. Program. 56, 31-43
26. Pang, J.-S. (1990): Newton's method for B-differentiable equations. Math. Oper. Res. 15, 311-341
27. Pang, J.-S. (1991): A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity, and variational inequality problems. Math. Program. 51, 101-131
28. Qi, L., Sun, D. (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. May 1997. To appear in Math. Comp.
29. Tseng, P. (1994): Simplified analysis of an O(nL)-iteration infeasible predictor-corrector path-following method for monotone LCP. In: Agarwal, R.P., ed., Recent Trends in Optimization Theory and Applications, pp. 423-434. World Scientific Press, Singapore
30. Tseng, P. (1996): Growth behavior of a class of merit functions for the nonlinear complementarity problem. J. Optimization Theory Appl. 89, 17-37
31. Wright, S.J. (1993): A path-following infeasible-interior-point algorithm for linear complementarity problems. Optimization Methods Software 2, 79-106
32. Xu, S. (1996): The global linear convergence of an infeasible non-interior path-folowing algorithm for complementarity problems with uniform P-functions. Technique Report, Department of Mathematics, University of Washington, Seattle, WA 98195. December 1996
33. Xu, S. (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. Technique Report, Department of Mathematics, University of Washington, Seattle, WA 98195. February 1997
34. Ye, Y., Anstreicher, K. (1993): On quadratic and O(√nL)-iteration convergence of a predictor-corrector algorithm for LCP. Math. Program. 62, 537-551
35. 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