A Globally Convergent Smoothing Newton Method for Nonsmooth Equations and Its Application to Complementarity Problems

被引:0
作者
Kouichi Taji
Motohiro Miyamoto
机构
[1] Osaka University,Department of Systems and Human Science, Graduate School of Engineering Science
[2] NEC Corporation,1st Personal C & C Operations Unit
来源
Computational Optimization and Applications | 2002年 / 22卷
关键词
smoothing method; Newton's method; global convergence; semismooth; complementarity problem;
D O I
暂无
中图分类号
学科分类号
摘要
The complementarity problem is theoretically and practically useful, and has been used to study and formulate various equilibrium problems arising in economics and engineerings. Recently, for solving complementarity problems, various equivalent equation formulations have been proposed and seem attractive. However, such formulations have the difficulty that the equation arising from complementarity problems is typically nonsmooth. In this paper, we propose a new smoothing Newton method for nonsmooth equations. In our method, we use an approximation function that is smooth when the approximation parameter is positive, and which coincides with original nonsmooth function when the parameter takes zero. Then, we apply Newton's method for the equation that is equivalent to the original nonsmooth equation and that includes an approximation parameter as a variable. The proposed method has the advantage that it has only to deal with a smooth function at any iteration and that it never requires a procedure to decrease an approximation parameter. We show that the sequence generated by the proposed method is globally convergent to a solution, and that, under semismooth assumption, its convergence rate is superlinear. Moreover, we apply the method to nonlinear complementarity problems. Numerical results show that the proposed method is practically efficient.
引用
收藏
页码:81 / 101
页数:20
相关论文
共 48 条
  • [1] Bertsekas D.P.(1982)Projection methods for variational inequalities with application to the traffic assignment problem Mathematical Programming Study 17 139-159
  • [2] Gafni E.M.(1996)A class of smoothing functions for nonlinear and mixed complementarity problems Computational Optimization and Applications 5 97-138
  • [3] Chen C.(1998)Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities Mathematics of Computations 67 519-540
  • [4] Mangasarian O.L.(1996)A semismooth equation approach to the solution of nonlinear complementarity problems Mathematical Programming 75 407-439
  • [5] Chen X.(2000)A theoretical and numerical comparison of some semismooth algorithms for complementarity problems Computational Optimization and Applications 16 173-205
  • [6] Qi L.(1997)A new merit function for nonlinear complementarity problems and a related algorithm SIAM Journal on Optimization 7 225-247
  • [7] Sun D.(1979)Computational complexity of LCPs associated with positive definite symmetric matrices Mathematical Programming 17 335-344
  • [8] De Luca T.(1992)Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems Mathematical Programming 53 99-110
  • [9] Facchinei F.(1992)An inexact NE/SQP method for solving the nonlinear complementarity problem Computational Optimization and Applications 1 67-91
  • [10] Kanzow C.(1988)Accelerating the convergence of the diagonalization and projection algorithms for finitedimensional variational inequalities Mathematical Programming 41 29-59