A smoothing conjugate gradient algorithm for nonlinear complementarity problems

Ahn, B.H. (1983). Iterative methods for linear complementarity problem with upperbounds and lowerbounds. Mathematical Programming, 26: 265–315

Chen, B. & Harker, P.T. (1993). A non-interior-point continuation method for linear complementarity problems. SIAM Journal on Matrix Analysis and Applications, 14 (4): 1168–1190

Chen, C. & Mangasarian, O.L. (1996). A class of smoothing functions for nonlinear and mixed complementarity problems. Computational Optimization and Applications, 5 (2): 97–138

Chen, X. & Ye, Y. (1999). On homotopy-smoothing methods for boxconstrained variational inequalities. SIAM Journal on Control and Optimization, 37: 589–616

Chen, X. & Ye, Y. (2000). On smoothing methods for the P 0-matrix linear complementarity problem. SIAM Journal on Optimization, 11: 341–363

Deluca, T., Facchinei, F. & Kanzow, C. (1996). A semismooth equation approach to the solution of nonlinear complementarity problems. Mathmatical Programming, 75 (3): 407–439

Ferris, M.C., Kanzow, C. & Munson, T.S. (1999). Feasible descent algorithms for mixed complementarity problems. Mathematical Programming, 86 (3): 475–497

Fischer, A. (1992). A special Newton-type optimization method. Optimization, 24 (3): 269–284

Geiger, C. & Kanzow, C. (1996). On the resolution of monotone complementarity problems. Computational Optimization and Applications, 5 (2): 155–173

Harker, P.T. & Pang, J.S. (1990). A damped-Newton method for the linear complementarity problem. Lectures in Applied Mathematics, 26: 265–284

He, S.L. & Xu, C.X. (2001). Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity. Science in China (Series A ), 44 (3): 338–344

Ji, J., Potra, F.A. & Huang, S. (1991). A predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence. Technical Report 18, Department of Mathematics, University of Iowa, Iowa City

Kanzow, C. (2001). Strictly feasible equation-based methods for mixed complementarity problems. Numerische Mathematik, 89 (1): 135–160

Kanzow, C. (1996). Some noninterior continuation methods for linear complementarity problems. SIAM Journal on Matrix Analysis and Applications, 17 (4): 851–868

Pardalos, P.M., Ye, Y., Han, C.G. & Kaliski, J.A. (1993). Solution of P 0 -matrix linear complementarity problems using a potential reduction algorithm. SIAM Journal on Matrix Analysis and Applications, 14: 1048–1060

Ulji & Chen, G.Q. (2005). New simple smooth merit function for box constrained variational inequalities and damped Newton type method. Applied Mathematics and Mechanics, 26 (8): 1083–1092

Xu, S. & Burke, J.V. (1999). A polynomialtime interior-point path-following algorithm for LCP based on Chen-Harker-Kanzow smoothing techniques. Mathematical Programming, 86 (1): 91–103

Xu, H. & Chang, X.W. (1997). Approximate Newton methods for nonsmooth equations. Journal of Optimization Theory and Applications, 93 (2): 373–394

Xu, H. & Glover, B.M. (1997). New version of the Newton method for nonsmooth equations. Journal of Optimization Theory and Applications, 93: 395–415

Xiu, N. & Zhang, J. (2003). Some recent advances in projection-type methods for variational inequalities. Journal of Computational and Applied Mathematics, 152 (1): 559–585

Yamashita, N. & Fukushima, M. (1997). Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems. Mathematical Programming, 76 (3): 469–491