[1] Billups S C. Algorithms for complementarity problems and generalized equations.
[Ph D Thesis]. Computer
Sciences Department, University of Wisconsin, Madison, WI, 1995

[2] Harker P T, Pang J S. Finite-dimensional variation inequality and nonlinear complementarity problems:
A survey of theory, algorithms and applications. Math Prog, 1990, 48: 161-220

[3] Robinson S M. Gneralized equations. In: Bachem A, Grotschel M, Korte B, eds. Math Prog: The State
of the Art. Berlin: Springer-Verlag, 1983. 346-347

[4] Qi L, Sun D, Zhou G. A new look at smoothing Newton methods for nonlinear complementarity problems
and box constrained variational inequalities. Math Prog, 2000, 87: 1-35

[5] Ferris M C, Kanzow C, Munson T S. Feasible descent algorithms for mixed complementarity problems.
Math Prog, 1999, 86: 475-497

[6] Facchinei F, Soares J. A new merit function for nonlinear complementarity problems and a related algo-
rithm. SIAM J Optim, 1997, 7(1): 225-247

[7] Facchinei F, Kanzow C. Beyond monotonicity in regularization methods for nonlinear complementarity
problems. SIAM J Cont and Optim, 1999, 37 (4):1150-1161

[8] Sun D. A regularization Newton method for solving nonlinear complementarity problems. Appl Math
Optim, 1999, 40: 315-339

[9] Cottle K W, Pang J S, Stone R E. The Linear Complemetarity Problem. Boston: Academic Press, 1992

[10] Mor´e J J, Rheinboldt W C. On P- and S- functions and related classes of n-dimensional nonlinear map-
pings. Linear Algebra Appl, 1973, 6: 45-68

[11] Kanzow C. Global convergence properties of some iterative methods for linear complementarity problem.
SIAM J Optim, 1996, 6: 326-341

[12] Clarke F H. Optimization and nonsmooth analysis. New York: Wiley, 1983

[13] Qi L, Sun J. A nonsmooth version of Newton’s method. Math Prog, 1993, 58: 353-367