Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
Open Access
- 1 April 1998
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 67 (222) , 519-540
- https://doi.org/10.1090/s0025-5718-98-00932-6
Abstract
The smoothing Newton method for solving a system of nonsmooth equations F ( x ) = 0 F(x)=0 , which may arise from the nonlinear complementarity problem, the variational inequality problem or other problems, can be regarded as a variant of the smoothing method. At the k k th step, the nonsmooth function F F is approximated by a smooth function f ( ⋅ , ε k ) f(\cdot , \varepsilon _k) , and the derivative of f ( ⋅ , ε k ) f(\cdot , \varepsilon _k) at x k x^k is used as the Newton iterative matrix. The merits of smoothing methods and smoothing Newton methods are global convergence and convenience in handling. In this paper, we show that the smoothing Newton method is also superlinearly convergent if F F is semismooth at the solution and f f satisfies a Jacobian consistency property. We show that most common smooth functions, such as the Gabriel-Moré function, have this property. As an application, we show that for box constrained variational inequalities if the involved function is P P –uniform, the iteration sequence generated by the smoothing Newton method will converge to the unique solution of the problem globally and superlinearly (quadratically).Keywords
This publication has 42 references indexed in Scilit:
- Inexact Newton methods for solving nonsmooth equationsJournal of Computational and Applied Mathematics, 1995
- The path solver: a nommonotone stabilization scheme for mixed complementarity problemsOptimization Methods and Software, 1995
- A Newton method for a class of quasi-variational inequalitiesComputational Optimization and Applications, 1995
- A parameterized Newton method and a quasi-Newton method for nonsmooth equationsComputational Optimization and Applications, 1994
- Newton's method for a class of nonsmooth functionsSet-Valued Analysis, 1994
- The Implicit General Order Complementarity Problem, models and iterative methodsAnnals of Operations Research, 1993
- Fast Algorithms for Nonsmooth Compact Fixed-Point ProblemsSIAM Journal on Numerical Analysis, 1992
- A special newton-type optimization methodOptimization, 1992
- Convergence domains of certain iterative methods for solving nonlinear equationsNumerical Functional Analysis and Optimization, 1989
- Iterative Solution of Nonlinear Equations in Several VariablesMathematics of Computation, 1971