Superlinearly Convergent Algorithms for Solving Singular Equations and Smooth Reformulations of Complementarity Problems

We propose a new algorithm for solving smooth nonlinear equations in the case where their solutions can be singular. Compared to other techniques for computing singular solutions, a distinctive feature of our approach is that we do not employ second derivatives of the equation mapping in the algorithm and we do not assume their existence in the convergence analysis. Important examples of once but not twice differentiable equations whose solutions are inherently singular are smooth equation-based reformulations of the nonlinear complementarity problems. Reformulations of complementarity problems serve both as illustration of and motivation for our approach, and one of them we consider in detail. We show that the proposed method possesses local superlinear/quadratic convergence under reasonable assumptions. We further demonstrate that these assumptions are in general not weaker and not stronger than regularity conditions employed in the context of other superlinearly convergent Newton-type algorithms for solving complementarity problems, which are typically based on nonsmooth reformulations. Therefore our approach appears to be an interesting complement to the existing ones.

[1]  A. Griewank.  On Solving Nonlinear Equations with Simple Singularities or Nearly Singular Solutions , 1985 .

[2]  Alexey F. Izmailov,et al.  Error bounds for 2-regular mappings with Lipschitzian derivatives and their applications , 2001, Math. Program..

[3]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[4]  Francisco Facchinei,et al.  A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm , 1997, SIAM J. Optim..

[5]  C. Kelley,et al.  Convergence Acceleration for Newton’s Method at Singular Points , 1982 .

[6]  G. Isac.  Complementarity Problems , 1992 .

[7]  O. Mangasarian.  Equivalence of the Complementarity Problem to a System of Nonlinear Equations , 1976 .

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

[9]  Christian Kanzow,et al.  Complementarity And Related Problems: A Survey , 1998 .

[10]  G. Reddien,et al.  Characterization and computation of singular points with maximum rank deficiency , 1986 .

[11]  J. P. Fink,et al.  A geometric framework for the numerical study of singular points , 1987 .

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

[13]  K. G. Murty,et al.  Complementarity problems , 2000 .

[14]  C. Kanzow.  Some equation-based methods for the nonlinear complementarity problem , 1994 .

[15]  Michael C. Ferris,et al.  Complementarity and variational problems : state of the art , 1997 .

[16]  B. Kummer.  Newton’s Method Based on Generalized Derivatives for Nonsmooth Functions: Convergence Analysis , 1992 .

[17]  Masao Fukushima,et al.  Solving box constrained variational inequalities by using the natural residual with D-gap function globalization , 1998, Oper. Res. Lett..

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

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

[20]  S. M. Robinson.  Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity , 1987 .

[21]  Wolfgang Middelmann,et al.  Augmented Systems for the Computation of Singular Points in Banach Space Problems , 1998 .

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

[23]  Alexey F. Izmailov,et al.  An approach to finding singular solutions to a general system of nonlinear equations , 2000 .

[24]  Stephen M. Robinson,et al.  Strongly Regular Generalized Equations , 1980, Math. Oper. Res..

[25]  Alexey F. Izmailov.  Higher-order methods for finding irregular solutions of non-linear operator equations , 1996 .

[26]  Klaus Böhmer,et al.  Direct Methods for Solving Singular Nonlinear Equations , 1999 .

[27]  Klaus Böhmer,et al.  Resolving singular nonlinear equations , 1988 .

[28]  Liqun Qi,et al.  Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations , 1993, Math. Oper. Res..

[29]  Houyuan Jiang,et al.  Semismoothness and Superlinear Convergence in Nonsmooth Optimization and Nonsmooth Equations , 1996 .

[30]  Francisco Facchinei,et al.  A Theoretical and Numerical Comparison of Some Semismooth Algorithms for Complementarity Problems , 2000, Comput. Optim. Appl..

[31]  A. Griewank,et al.  Characterization and Computation of Generalized Turning Points , 1984 .

[32]  Alexey F. Izmailov,et al.  Local regularization of certain classes of non-linear operator equations , 1996 .

[33]  Alexey F. Izmailov.  On some generalizations of Morse lemma , 1998 .

[34]  Jong-Shi Pang,et al.  NE/SQP: A robust algorithm for the nonlinear complementarity problem , 1993, Math. Program..

[35]  Jong-Shi Pang,et al.  Nonsmooth Equations: Motivation and Algorithms , 1993, SIAM J. Optim..

[36]  C. Kelley,et al.  Newton’s Method at Singular Points. I , 1980 .

[37]  Defeng Sun,et al.  On NCP-Functions , 1999, Comput. Optim. Appl..

[38]  S. M. Robinson.  Local structure of feasible sets in nonlinear programming , 1983 .

[39]  H. Keller,et al.  CONVERGENCE RATES FOR NEWTON'S METHOD AT SINGULAR POINTS* , 1983 .

[40]  A. Griewank.  Starlike domains of convergence for Newton's method at singularities , 1980 .

[41]  Christian Kanzow,et al.  On the resolution of monotone complementarity problems , 1996, Comput. Optim. Appl..

[42]  R. Mifflin.  Semismooth and Semiconvex Functions in Constrained Optimization , 1977 .

[43]  A. F. Izmailovy,et al.  THE THEORY OF 2-REGULARITY FOR MAPPINGS WITH LIPSCHITZIAN DERIVATIVES AND ITS APPLICATIONS TO OPTIMALITY CONDITIONS , 2001 .

[44]  Alexey F. Izmailov,et al.  The Theory of 2-Regularity for Mappings with Lipschitzian Deriatives and its Applications to Optimality Conditions , 2002, Math. Oper. Res..