Approximate Newton Methods for Nonsmooth Equations

We develop general approximate Newton methods for solving Lipschitz continuous equations by replacing the iteration matrix with a consistently approximated Jacobian, thereby reducing the computation in the generalized Newton method. Locally superlinear convergence results are presented under moderate assumptions. To construct a consistently approximated Jacobian, we introduce two main methods: the classic difference approximation method and the ε-generalized Jacobian method. The former can be applied to problems with specific structures, while the latter is expected to work well for general problems. Numerical tests show that the two methods are efficient. Finally, a norm-reducing technique for the global convergence of the generalized Newton method is briefly discussed.

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

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

[3]  D. Mayne,et al.  Nondifferential optimization via adaptive smoothing , 1984 .

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

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

[6]  S. M. Robinson.  An Implicit-Function Theorem for B-Differentiable Functions , 1988 .

[7]  Patrick T. Harker,et al.  Newton's method for the nonlinear complementarity problem: A B-differentiable equation approach , 1990, Math. Program..

[8]  Jong-Shi Pang,et al.  Newton's Method for B-Differentiable Equations , 1990, Math. Oper. Res..

[9]  Jong-Shi Pang,et al.  A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems , 1991, Math. Program..

[10]  Jerzy Kyparisis,et al.  Local convergence of quasi-Newton methods for B-differentiable equations , 1992, Math. Program..

[11]  Liqun Qi,et al.  An interior point algorithm of $$O(\sqrt m \left| {\ln \varepsilon } \right|)$$ iterations forC1-convex programming , 1992, Math. Program..

[12]  Liqun Qi,et al.  An interior point algorithm of In iterations for C-convex programming , 1992 .

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

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

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

[16]  Patrick T. Harker,et al.  A nonsmooth Newton method for variational inequalities, II: Numerical results , 1994, Math. Program..

[17]  Patrick T. Harker,et al.  A nonsmooth Newton method for variational inequalities, I: Theory , 1994, Math. Program..

[18]  Xiaojun Chen,et al.  A parameterized Newton method and a quasi-Newton method for nonsmooth equations , 1994, Comput. Optim. Appl..

[19]  R. D. Murphy,et al.  Iterative solution of nonlinear equations , 1994 .

[20]  Liqun Qi,et al.  Superlinearly convergent approximate Newton methods for LC1 optimization problems , 1994, Math. Program..

[21]  S. M. Robinson.  Newton's method for a class of nonsmooth functions , 1994 .

[22]  J. M. Martínez,et al.  Inexact Newton methods for solving nonsmooth equations , 1995 .

[23]  Huifu Xu,et al.  New Version of the Newton Method for Nonsmooth Equations , 1997 .