A one-parametric class of smoothing functions and an improved regularization Newton method for the NCP

References

• Chen J-S, Pan SH. A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for P\textsubscript{0}-NCPs. J. Comput. Appl. Math. 2008;220:464–479.
   Web of Science ®Google Scholar
• Chen XH, Ma CF. A regularization smoothing Newton method for solving nonlinear com- plementarity problem. Nonlinear Anal. Real World Appl. 2009;10:1702–1711.
   Web of Science ®Google Scholar
• Fang L. A new one-step smoothing Newton method for nonlinear complementarity problem with P\textsubscript{0}-function. Appl. Math. Comput. 2010;216:1087–1095.
   Web of Science ®Google Scholar
• Hu SL, Huang ZH, Wang P. A non-monotone smoothing Newton algorithm for solving nonlinear complementarity problems. Optim. Methods Software 2009;24:447–460.
   Web of Science ®Google Scholar
• Huang N, Ma CF. The numerical study of a regularized smoothing Newton method for solving P\textsubscript{0}-NCP based on the generalized smoothing Fischer-Burmeister function. Appl. Math. Comput. 2012;218:7253–7269.
   Web of Science ®Google Scholar
• Huang ZH, Han JY, Xu DC, et al. The non-interior continuation methods for solving the P\textsubscript{0} function nonlinear complementarity problem. Sci. China. 2001;44:1107–1114.
   Google Scholar
• Huang ZH, Han J, Chen Z. Predictor-corrector smoothing Newton algorithm, based on a new smoothing function, for solving the nonlinear complementarity problem with a P\textsubscript{0} function. J. Optim. Theory Appl. 2003;117:39–68.
   Web of Science ®Google Scholar
• Ma CF. A new smoothing and regularization Newton method for P\textsubscript{0}-NCP. J. Global Optim. 2010;48:241–261.
   Web of Science ®Google Scholar
• Ni T, Wang P. A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search. Appl. Math. Comput. 2010;216:2207–2214.
   Web of Science ®Google Scholar
• Qi L, Sun D, Zhou G. A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities. Math. Program. 2000;87:1–35.
   Web of Science ®Google Scholar
• Sun D. A regularization Newton method for solving nonlinear complementarity problems. Appl. Math. Optim. 1999;40:315–339.
   Web of Science ®Google Scholar
• Tang JY, Dong L, Zhou JC, et al. A smoothing Newton method for nonlinear complementarity problems. Comput. Appl. Math. 2013;32:107–118.
   Web of Science ®Google Scholar
• Zhang LP, Han JY, Huang ZH. Superlinear/quadratic one-step smoothing Newton method for P\textsubscript{0}-NCP. Acta Math. Sinica English Ser. 2005;21:117–128.
   Web of Science ®Google Scholar
• Zhang LP, Wu SY, Gao TR. Improved smoothing Newton methods for P0 nonlinear complementarity problems. Appl. Math. Comput. 2009;215:324–332.
   Web of Science ®Google Scholar
• Grippo L, Lampariello F, Lucidi S. A nonmonotone line search technique for Newton’s method. SIAM J. Numer. Anal. 1986;23:707–716.
   Web of Science ®Google Scholar
• Zhang HC, Hager WW. A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim. 2004;14:1043–1056.
   Web of Science ®Google Scholar
• Tang JY, Dong L, Zhou JC, et al. A smoothing-type algorithm for the second-order cone complementarity problem with a new nonmonotone line search. Optimization. 2015;64:1935–1955.
   Web of Science ®Google Scholar
• Tang JY, Dong L, Fang L, et al. Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search. Optim. Lett. 2014;8:1753–1771.
   Web of Science ®Google Scholar
• Huang ZH, Hu SL, Han JY. Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search. Sci. China Ser. A: Math. 2009;52:833–848.
   Google Scholar
• Zhu JG, Liu HW, Liu CH. A family of new smoothing functions and a nonmonotone smoothing Newton method for the nonlinear complementarity problems. J. Appl. Math. Comput. 2011;37:647–662.
   Google Scholar
• Chen B, Xiu N. Superlinear noninterior one-step continuation method for monotone LCP in absence of strict complementarity. J. Optim. Theory Appl. 2001;108:317–332.
   Web of Science ®Google Scholar
• Chi XN, Liu SY. A non-interior continuation method for second-order cone optimization. Optimization. 2009;58:965–979.
   Web of Science ®Google Scholar
• Chi XN, Liu SY. A one-step smoothing Newton method for second-order cone programming. J. Comput. Appl. Math. 2009;223:114–123.
   Web of Science ®Google Scholar
• Zhang XS, Liu SY, Liu ZH. A smoothing method for second order cone complementarity problem. J. Comput. Appl. Math. 2009;228:83–91.
   Web of Science ®Google Scholar
• Huang ZH, Ni T. Smoothing algorithms for complementarity problems over symmetric cones. Comput. Optim. Appl. 2010;45:557–579.
   Web of Science ®Google Scholar
• Mifflin R. Semismooth and semiconvex functions in constrained optimization. SIAM J. Control Optim. 1977;15:957–972.
   Web of Science ®Google Scholar
• Qi L, Sun J. A nonsmooth version of Newtons method. Math. Program. 1993;58:353–367.
   Web of Science ®Google Scholar
• Clarke FH. Optimization and nonsmooth analysis. New York (NY): Wiley; 1983. Reprinted by Philadelphia (PA): SIAM; 1990.
   Google Scholar
• Gowda MS, Tawhid MA. Existence and limiting behavior of trajectories associated with P\textsubscript{0}-equations. Comput. Optim. Appl. 1999;12:229–251.
   Web of Science ®Google Scholar
• Qi L. Convergence analysis of some algorithms for solving nonsmooth equations. Math. Oper. Res. 1993;18:227–244.
   Web of Science ®Google Scholar