On smoothing methods for the P0 matrix linear complementarity problem

SIAM Journal on Optimization

Volumn 11, Issue 2, 2000, Pages 341-363

  Chen, Xiaojun ^a   Ye, Yinyu ^b  

^a SHIMANE UNIVERSITY   (Japan)

^b UNIVERSITY OF IOWA   (United States)

Author keywords

Linear complementarity problem; P0 matrix; Smoothing algorithm

Indexed keywords

EID: 0034353739     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623498335080     Document Type: Article

References (20)

1. J. BURKE AND S. XU, The global linear convergence of a non-interior path-following algorithm for linear complementarity problem, Math. Oper. Res., 23 (1998), pp. 719-734.
2. 0 NCP or monotone NCP, SIAM J. Optim., 9 (1999), pp. 624-645.
3. C. CHEN AND O.L. MANGASARIAN, Smoothing methods for convex inequalities and linear complementarity problems, Math. Programming, 71 (1995), pp. 51-69.
4. X. CHEN AND Y. YE, On homotopy-smoothing methods for box-constrained variational inequalities, SIAM J. Control Optim., 37 (1999), pp. 589-616.
5. R.W. COTTLE, J.-S. PANG, AND R.E. STONE, The Linear Complementarity Problem, Academic Press, Boston, 1992.
6. F. FACCHINEI AND C. KANZOW, Beyond monotonicity in regularization methods for nonlinear complementarity problems, SIAM J. Control Optim., 37 (1999), pp. 1150-1161.
7. F. FACCHINEI AND J.-S. PANG, Total Stability of Variational Inequalities, Tech. report, Universitá di Roma "La Sapienza," Dipartmento di Informatica e Sistemistica, Via Buonarroti, Roma, Italy, 1998.
8. S.A. GABRIEL AND J.J. MORÉ, Smoothing of mixed complementarity problems, in Complementarity and Variational Problems: State of the Art, M.C. Ferris and J.S. Pang, eds., SIAM, Philadelphia, PA, 1996, pp. 105-116.
9. C. KANZOW, Some noninterior continuation methods for linear complementarity problems, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 851-868.
10. M. KOJIMA, N. MEGIDDO, AND T. NOMA, Homotopy continuation methods for nonlinear complementarity problems, Math. Oper. Res., 16 (1991), pp. 754-774.
11. M. KOJIMA, N. MEGIDDO, T. NOMA, AND A. YOSHISE, A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Lecture Notes in Computer Science 538, Springer-Verlag, New York, 1991.
12. M. KOJIMA, S. MIZUNO, AND A. YOSHISE, A little theorem of the big M in interior point algorithms, Math. Programming, 59 (1993), pp. 361-375.
13. J.M. ORTEGA AND W.C. RHEINBOLDT, Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, 1970.
14. 0-matrix linear complementarity problems using a potential reduction algorithm, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 1048-1060.
15. 0-functions, SIAM J. Optim., 10 (1999), pp. 315-330.
16. 0-Function in Box Variational Inequality Problems, Research report, Department of Mathematics and Statistics, University of Maryland Baltimore County, Baltimore, 1997.
17. S. ROBINSON, Generalized equations and their solutions. I, Math. Programming Stud., 10 (1979), pp. 128-141.
18. D. SUN, A regularized Newton method for solving nonlinear complementarity problems, Appl. Math. Optim., 40 (1999), pp. 315-339.
19. 0-complementarity problem, in Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, M. Fukushima and L. Qi, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 1998, pp. 371-379.
20. Y. YE, On homogeneous and self-dual algorithms for LCP, Math. Programming, 76 (1997), pp. 211-222.