A Superlinearly Convergent Algorithm for the Monotone Nonlinear Complementarity Problem Without Uniqueness and Nondegeneracy Conditions

The purpose of this paper is to present an algorithm for solving the monotone nonlinear complementarity problem (NCP) that enjoys superlinear convergence in a genuine sense without the uniqueness and nondegeneracy conditions. Recently, Yamashita and Fukushima (2001) proposed a method based on the proximal point algorithm (PPA) for monotone NCP. The method has the favorable property that a generated sequence converges to the solution set of NCP superlinearly. However, when a generated sequence converges to a degenerate solution, the subproblems may become computationally expensive and the method does not have genuine superlinear convergence. More recently, Yamashita et al. (2001) presented a technique to identify whether a solution is degenerate or not. Using this technique, we construct a differentiable system of nonlinear equations in which the solution is a solution of the original NCP. Moreover, we propose a hybrid algorithm that is based on the PPA and uses this system. We show that the proposed algorithm has a genuine quadratic or superlinear rate of convergence even if it converges to a solution that is neither unique nor nondegenerate.

[1]  Francisco Facchinei,et al.  A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems , 1997, Math. Program..

[2]  Nobuo Yamashita,et al.  On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm , 2004, Math. Program..

[3]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[4]  Francisco Facchinei,et al.  On the Identification of Zero Variables in an Interior-Point Framework , 1999, SIAM J. Optim..

[5]  Stephen J. Wright.  Constraint identification and algorithm stabilization for degenerate nonlinear programs , 2000, Math. Program..

[6]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[7]  S. M. Robinson.  Some continuity properties of polyhedral multifunctions , 1981 .

[8]  A. Fischer.  A special newton-type optimization method , 1992 .

[9]  Xiaojun Chen.  SMOOTHING METHODS FOR COMPLEMENTARITY PROBLEMS AND THEIR APPLICATIONS : A SURVEY , 2000 .

[10]  Jong-Shi Pang,et al.  A Posteriori Error Bounds for the Linearly-Constrained Variational Inequality Problem , 1987, Math. Oper. Res..

[11]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[12]  Masao Fukushima,et al.  The Proximal Point Algorithm with Genuine Superlinear Convergence for the Monotone Complementarity Problem , 2000, SIAM J. Optim..

[13]  Andreas Fischer,et al.  Modified Wilson's Method for Nonlinear Programs with Nonunique Multipliers , 1999, Math. Oper. Res..

[14]  Masao Fukushima,et al.  Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions , 2002, Optim. Methods Softw..

[15]  Michael C. Ferris,et al.  Engineering and Economic Applications of Complementarity Problems , 1997, SIAM Rev..

[16]  Francisco Facchinei,et al.  A semismooth equation approach to the solution of nonlinear complementarity problems , 1996, Math. Program..

[17]  P. Tseng.  Growth behavior of a class of merit functions for the nonlinear complementarity problem , 1996 .

[18]  F. Facchinei,et al.  Beyond Monotonicity in Regularization Methods for Nonlinear Complementarity Problems , 1999 .