On Homotopy-Smoothing Methods for Variational Inequalities

A variational inequality problem with a mapping g : < n ! < n and lower and upper bounds on variables can be reformulated as a system of nonsmooth equations F (x) = 0 in < n. Recently, several homotopy methods, such as interior-point and smoothing methods, have been employed to solve the problem. All of these methods use parametric functions and construct perturbed equations to approximate the problem. The solution to the perturbed system constitutes a smooth trajectory leading to the solution of the original variational inequality problem. The methods generate iterates to follow the trajectory. Among these methods Chen-Mangasarian and Gabriel-Mor e proposed a class of smooth functions to approximate F. In this paper, we study several properties of the trajectory deened by solutions of these smooth systems. We propose a homotopy-smoothing method for solving the variational inequality problem, and show that the method converges globally and super-linearly under mild conditions. Furthermore, if the involved function g is an aane function, the method nds a solution of the problem in nite steps. Preliminary numerical results indicate that the method is promising.

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

[2]  B. Curtis Eaves,et al.  On the basic theorem of complementarity , 1971, Math. Program..

[3]  Patrick T. Harker,et al.  Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications , 1990, Math. Program..

[4]  Nimrod Megiddo,et al.  Homotopy Continuation Methods for Nonlinear Complementarity Problems , 1991, Math. Oper. Res..

[5]  Yinyu Ye,et al.  On the finite convergence of interior-point algorithms for linear programming , 1992, Math. Program..

[6]  Nimrod Megiddo,et al.  An interior point potential reduction algorithm for the linear complementarity problem , 1992, Math. Program..

[7]  Bintong Chen,et al.  A Non-Interior-Point Continuation Method for Linear Complementarity Problems , 1993, SIAM J. Matrix Anal. Appl..

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

[9]  P. TsengyJune Simpliied Analysis of an O(nl)-iteration Infeasible Predictor-corrector Path-following Method for Monotone Lcp , 1994 .

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

[11]  S. Dirkse,et al.  The path solver: a nommonotone stabilization scheme for mixed complementarity problems , 1995 .

[12]  L. Qi,et al.  A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations , 1995 .

[13]  Olvi L. Mangasarian,et al.  A class of smoothing functions for nonlinear and mixed complementarity problems , 1996, Comput. Optim. Appl..

[14]  Y. Ye,et al.  Interior-point methods for nonlinear complementarity problems , 1996 .

[15]  Christian Kanzow,et al.  Some Noninterior Continuation Methods for Linear Complementarity Problems , 1996, SIAM J. Matrix Anal. Appl..

[16]  Xiaojun Chen Superlinear convergence of smoothing quasi-Newton methods for nonsmooth equations , 1997 .

[17]  Patrick T. Harker,et al.  Smooth Approximations to Nonlinear Complementarity Problems , 1997, SIAM J. Optim..

[18]  F. Facchinei,et al.  A semismooth Newton method for variational in - equalities: The case of box constraints , 1997 .

[19]  Michael C. Ferris,et al.  Engineering and Economic Applications of Complementarity Problems , 1997, SIAM Rev..

[20]  Xiaojun Chen,et al.  Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities , 1998, Math. Comput..

[21]  Steven A. Gabriel,et al.  A Hybrid Smoothing Method for Mixed Nonlinear Complementarity Problems , 1998, Comput. Optim. Appl..

[22]  James V. Burke,et al.  The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems , 1998, Math. Oper. Res..

[23]  Masao Fukushima,et al.  Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities , 1998, Math. Program..

[24]  James V. Burke,et al.  A polynomial time interior–point path–following algorithm for LCP based on Chen–Harker–Kanzow smoothing techniques , 1999, Math. Program..