On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm

Abstract.In this paper we focus on the problem of identifying the index sets P(x):={i|xi>0}, N(x):={i|Fi(x)>0} and C(x):={i|xi=Fi(x)=0} for a solution x of the monotone nonlinear complementarity problem NCP(F). The correct identification of these sets is important from both theoretical and practical points of view. Such an identification enables us to remove complementarity conditions from the NCP and locally reduce the NCP to a system which can be dealt with more easily. We present a new technique that utilizes a sequence generated by the proximal point algorithm (PPA). Using the superlinear convergence property of PPA, we show that the proposed technique can identify the correct index sets without assuming the nondegeneracy and the local uniqueness of the solution.

[1]  R. Rockafellar.  Monotone Operators and the Proximal Point Algorithm , 1976 .

[2]  Klaus Schittkowski,et al.  Test examples for nonlinear programming codes , 1980 .

[3]  Klaus Schittkowski,et al.  More test examples for nonlinear programming codes , 1981 .

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

[5]  M. Kojima,et al.  EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS , 1986 .

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

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

[8]  Olvi L. Mangasarian,et al.  New Error Bounds for the Linear Complementarity Problem , 1994, Math. Oper. Res..

[9]  Yin Zhang,et al.  A Study of Indicators for Identifying Zero Variables in Interior-Point Methods , 1994, SIAM Rev..

[10]  A. Fischer.  An NCP–Function and its Use for the Solution of Complementarity Problems , 1995 .

[11]  Nicholas I. M. Gould,et al.  CUTE: constrained and unconstrained testing environment , 1995, TOMS.

[12]  Masao Fukushima,et al.  Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems , 1996, Math. Program..

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

[14]  Yin Zhang,et al.  On the convergence rate of Newton interior-point methods in the absence of strict complementarity , 1996, Comput. Optim. Appl..

[15]  Shinji Mizuno,et al.  High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems , 1998, Math. Oper. Res..

[16]  Francisco Facchinei,et al.  On the Accurate Identification of Active Constraints , 1998, SIAM J. Optim..

[17]  Houyuan Jiang.  Global Convergence Analysis of the Generalized Newton and Gauss-Newton Methods of the Fischer Burmeister Equation for the Complementarity Problem , 1999 .

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

[19]  Stephen C. Billups,et al.  Improving the robustness of descent-based methods for semismooth equations using proximal perturbations , 2000, Math. Program..

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