A nonmonotone smoothing Newton algorithm for solving nonlinear complementarity problems

The smoothing-type algorithm has been a powerful tool for solving various optimization problems. In order to improve the numerical results of the algorithm, the nonmonotone line search technique has been used when the algorithm is implemented. However, the theoretical analysis is based on the algorithm with some monotone line search. In this paper, based on the smoothed Kanzow–Kleinmichel NCP function, we propose a smoothing Newton algorithm for solving the nonlinear complementarity problem with a new nonmonotone line search. We show that the nonmonotone algorithm is globally and locally superlinearly convergent under suitable assumptions. The preliminary numerical results are also reported.

[1]  Defeng Sun,et al.  Sub-quadratic convergence of a smoothing Newton algorithm for the P0– and monotone LCP , 2004, Math. Program..

[2]  William W. Hager,et al.  A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization , 2004, SIAM J. Optim..

[3]  Paul Tseng,et al.  Non-Interior continuation methods for solving semidefinite complementarity problems , 2003, Math. Program..

[4]  Zheng-Hai Huang,et al.  Smoothing algorithms for complementarity problems over symmetric cones , 2010, Comput. Optim. Appl..

[5]  A. Tits,et al.  Avoiding the Maratos effect by means of a nonmonotone line search I. general constrained problems , 1991 .

[6]  M. Seetharama Gowda,et al.  Weak Univalence and Connectedness of Inverse Images of Continuous Functions , 1999, Math. Oper. Res..

[7]  Y. Ye,et al.  On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities , 1999 .

[8]  Nimrod Megiddo,et al.  A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems , 1991, Lecture Notes in Computer Science.

[9]  Francisco Facchinei,et al.  A smoothing method for mathematical programs with equilibrium constraints , 1999, Math. Program..

[10]  N. Xiu,et al.  Superlinear Noninterior One-Step Continuation Method for Monotone LCP in the Absence of Strict Complementarity , 2001 .

[11]  Bintong Chen,et al.  A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen-Mangasarian Smoothing Functions , 1999, SIAM J. Optim..

[12]  Houduo Qi,et al.  A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions , 1999, SIAM J. Optim..

[13]  Xiaojun Chen,et al.  Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities , 1998, Math. Comput..

[14]  M. Seetharama Gowda,et al.  Regularization of P[sub 0]-Functions in Box Variational Inequality Problems , 2000, SIAM J. Optim..

[15]  Ying Zhang,et al.  A smoothing-type algorithm for solving system of inequalities , 2008 .

[16]  S. Dirkse,et al.  A Comparison of Algorithms for Large Scale Mixed Complementarity Problems , 1995 .

[17]  Masao Fukushima,et al.  A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems , 2005, SIAM J. Optim..

[18]  Bintong Chen,et al.  A Non-Interior-Point Continuation Method for Linear Complementarity Problems , 1993, SIAM J. Matrix Anal. Appl..

[19]  Zhenghai Huang,et al.  Predictor-Corrector Smoothing Newton Method, Based on a New Smoothing Function, for Solving the Nonlinear Complementarity Problem with a P0 Function , 2003 .

[20]  Zheng-Hai Huang,et al.  Convergence properties of a non-interior-point smoothing algorithm for the P*NCP , 2007 .

[21]  Hui Wang,et al.  Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem , 2006, Appl. Math. Comput..

[22]  Christian Kanzow,et al.  Jacobian Smoothing Methods for Nonlinear Complementarity Problems , 1999, SIAM J. Optim..

[23]  Andreas Fischer,et al.  Solution of monotone complementarity problems with locally Lipschitzian functions , 1997, Math. Program..

[24]  Yuhong Dai.  On the Nonmonotone Line Search , 2002 .

[25]  Christian Kanzow,et al.  Improved smoothing-type methods for the solution of linear programs , 2002, Numerische Mathematik.

[26]  Michael C. Ferris,et al.  A Comparison of Large Scale Mixed Complementarity Problem Solvers , 1997, Comput. Optim. Appl..

[27]  L. Grippo,et al.  A truncated Newton method with nonmonotone line search for unconstrained optimization , 1989 .

[28]  James V. Burke,et al.  The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems , 1998, Math. Oper. Res..

[29]  Y. Ye,et al.  On Homotopy-Smoothing Methods for Variational Inequalities , 1999 .

[30]  Liwei Zhang,et al.  Analysis of a smoothing method for symmetric conic linear programming , 2006 .

[31]  Helmut Kleinmichel,et al.  A New Class of Semismooth Newton-Type Methods for Nonlinear Complementarity Problems , 1998, Comput. Optim. Appl..

[32]  Liqun Qi,et al.  A nonsmooth version of Newton's method , 1993, Math. Program..

[33]  L. Qi,et al.  Numerical Experiments for a Class of Squared Smoothing Newton Methods for Box Constrained Variational Inequality Problems , 1998 .

[34]  DaiYuhong,et al.  A NONMONOTONE CONJUGATE GRADIENT ALGORITHM FOR UNCONSTRAINED OPTIMIZATION , 2002 .

[35]  Olvi L. Mangasarian,et al.  A class of smoothing functions for nonlinear and mixed complementarity problems , 1996, Comput. Optim. Appl..

[36]  L. Grippo,et al.  A class of nonmonotone stabilization methods in unconstrained optimization , 1991 .

[37]  Defeng Sun,et al.  A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities , 2000, Math. Program..

[38]  Zhenghai Huang.  The global linear and local quadratic convergence of a non-interior continuation algorithm for the LCP , 2005 .