The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform P-functions

Mathematical Programming, Series B

Volumn 87, Issue 3, 2000, Pages 501-517

  Xu, Song ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Complementarity problems; Interior point method; Non interior point method; Path following; Uniform P function

Indexed keywords

EID: 0342608948     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050009     Document Type: Article

References (34)

1. Burke, J., Xu, S. (1998): The global linear convergence of a non-interior path-following algorithm for linear complementarity problem. Math. Oper. Res. 23, 719-734
2. Chen, B., Chen, X. (1997): A global linear and local quadratic continuation method for variational inequalities with box constraints. Technical report, Department of Management and Systems, Washington State University, Pullman, WA 99164-4736
3. 0 and monotone NCP. SIAM J. Optim. 9, 624-645
4. Chen, B., Harker, P.T. (1993): A non-interior-point continuation method for linear complementarity problems. SIAM J. Matrix Anal. Appl. 14, 1168-1190
5. Chen, B., Harker, P.T. (1997): Smooth approximations to nonlinear complementarity problems. SIAM J. Optim. 7, 403-420
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. SIAM J. Optim. 9, 605-623
7. Chen, C., Mangasarian, O.L. (1996): A class of smoothing functions for nonlinear and mixed complementarity problems. Comp. Optim. Appl. 5, 1168-1190
8. Cottle, R.W., Giannessi, F., Lions, J.-L., eds. (1980): Variational Inequalities and Complementarity Problems: Theory and Applications. John Wiley & Sons, New York
9. Cottle, R.W., Pang, J.S., Stone, R.E. (1992): The Linear Complementarity Problem. Academic Press, New York
10. Dirkse, S.P., Ferris, M.C. (1995): MCPLIB: A collection of nonlinear mixed complementarity problems. Optim. Methods Software 5, 319-345
11. Fathi, Y. (1979): Computational complexity of LCPs associated with positive definite matrices. Math. Program. 17, 335-344
12. Ferris, M.C., Pang, J.S. (1997): Engineering and economic applications of complementarity problems. SIAM Rev. 39, 669-713
13. Gabriel, S.A., Moré, J.J. (1997): Smoothing of mixed complementarity problems. In: Complementarity and variational problems (Baltimore, MD 1995), 105-116. SIAM, Philadelphia, PA
14. Harker, P.T. (1988): Accelerating the convergence of the diagonalization and projection algorithm for finite-dimensional variational inequalities. Math. Program. 41, 29-59
15. Hotta, K., Yoshise, A. (1999): Global convergence of a class of non-interior-point algorithms using Chen-Harker-Kanzow functions for nonlinear complementarity problems. Math. Program. 86, 105-133
16. Josephy, N.H. (1979): Newton's method for generalized equation. MRC Technical Summary Report 1965, Mathematics Research Center, University of Wisconsin-Madison, WI, USA
17. Kanzow, C. (1997): A new approach to continuation methods for complementarity problems with uniform P-functions. Oper. Res. Lett. 20, 85-92
18. Kanzow, C. (1996): Some noninterior continuation methods for linear complementarity problems. SIAM J. Matrix Anal. Appl. 17, 851-868
19. Kanzow, C., Jiang, H. (1998): A continuation method for (strongly) monotone variational inequalities. Math. Program. 81, 103-125
20. Kojima, M. (1974): Computational methods for solving the nonlinear complementarity problem. Kein Engin. Rep. 27, 27, 1-41
21. Kojima, M., Mizuno, S., Noma, T. (1989): A new continuation methods for complementarity problems with uniform P-functions. Math. Program. 43, 107-113
22. 1 equations. J. Oper. Res. Soc. Japan 29, 352-374
23. Mathiesen, L. (1987): An algorithm based on a sequence of linear complementarity problems applied to a Walrasian equilibrium model: an example. Math. Program. 37, 1-18
24. Moré, J.J. (1974): Classes of functions and feasibility conditions in nonlinear complementarity problems. Math. Program. 6, 327-338
25. Moré, J.J., Rheinbolt, W.C. (1973): On P- and S-functions and related classes of n-dimensional nonlinear mappings. Linear Algebra Appl. 6, 45-68
26. Murty, K.G. (1988): Linear Complementarity, Linear and Nonlinear Programming. In: Sigma Series in Applied Mathematics 3. Heldermann, Berlin
27. Pang, J.-S. (1994): Complementarity problems. In: Horst, R., Pardalos, P., eds., Handbook on Global Optimization, pp. 271-338. Kluwer Academic Publishers, Boston
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
29. Tseng, P. (1995): 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. (1998): Analysis of a non-interior continuation method based on Chen-Mangasarian smoothing functions for complementarity problems. In: Fukushima, M., Qi, L., eds., Reformulation-Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, pp. 381-404. Kluwer Academic Publishers, Boston
31. Watson, L.T. (1979): Solving the nonlinear complementarity problem by a homotopy method. SIAM J. Control Optim. 17, 36-46
32. Wright, S.J. (1993): A path-following infeasible-interior-point algorithm for linear complementarity problems. Optim. Methods Software 2, 79-106
33. 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
34. 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. Technical Report, Department of Mathematics, University of Washington, Seattle, WA 98195