Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities

نویسندگان

  • Xiaojun Chen
  • Liqun Qi
  • Defeng Sun
چکیده

The smoothing Newton method for solving a system of nonsmooth equations 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 kth step, the nonsmooth function F is approximated by a smooth function f(·, εk), and the derivative of f(·, εk) at xk 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 is semismooth at the solution and 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–uniform, the iteration sequence generated by the smoothing Newton method will converge to the unique solution of the problem globally and superlinearly (quadratically).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities

In this paper we take a new look at smoothing Newton methods for solving the nonlinear complementarity problem (NCP) and the box constrained variational inequalities (BVI). Instead of using an infinite sequence of smoothing approximation functions, we use a single smoothing approximation function and Robinson’s normal equation to reformulate NCP and BVI as an equivalent nonsmooth equation H(u, ...

متن کامل

Smoothing Functions and Smoothing Newton Method for Complementarity and Variational Inequality Problems

This paper provides for the first time some computable smoothing functions for variational inequality problems with general constraints. This paper proposes also a new version of the smoothing Newton method and establishes its global and superlinear (quadratic) convergence under conditions weaker than those previously used in the literature. These are achieved by introducing a general definitio...

متن کامل

A Global Linear and Local Quadratic Continuation Smoothing Method for Variational Inequalities with Box Constraints

In this paper, we propose a continuation method for box constrained variational inequality problems. The continuation method is based on the class of Gabriel-Mor e smooth functions and has the following attractive features: It can start from any point; It has a simple and natural neighborhood deenition; It solves only one approximate Newton equation at each iteration; It converges globally line...

متن کامل

Smoothing Functions and A Smoothing Newton Method for Complementarity and Variational Inequality Problems

In this paper, we discuss smoothing approximations of nonsmooth functions arising from complementarity and variational inequality problems. We present some new results which are essential in designing Newton-type methods. We introduce several new classes of smoothing functions for nonlinear complementarity problems and order complementarity problems. In particular, in the first time some comput...

متن کامل

A New Unconstrained Differentiable Merit Function for Box Constrained Variational Inequality Problems and a Damped Gauss-Newton Method

In this paper we propose a new unconstrained diierentiable merit function f for box constrained variational inequality problems VIP(l; u; F). We study various desirable properties of this new merit function f and propose a Gauss-Newton method in which each step only requires the solution of a system of linear equations. Global and superlinear convergence results for VIP(l; u; F) are obtained. K...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Comput.

دوره 67  شماره 

صفحات  -

تاریخ انتشار 1998