Discovery of new complementarity functions for NCP and SOCCP

2018 ◽  
Vol 37 (5) ◽  
pp. 5727-5749 ◽  
Author(s):  
Peng-Fei Ma ◽  
Jein-Shan Chen ◽  
Chien-Hao Huang ◽  
Chun-Hsu Ko
2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Zhensheng Yu ◽  
Zilun Wang ◽  
Ke Su

In this paper, a double nonmonotone quasi-Newton method is proposed for the nonlinear complementarity problem. By using 3-1 piecewise and 4-1 piecewise nonlinear complementarity functions, the nonlinear complementarity problem is reformulated into a smooth equation. By a double nonmonotone line search, a smooth Broyden-like algorithm is proposed, where a single solution of a smooth equation at each iteration is required with the reduction in the scale of the calculation. Under suitable conditions, the global convergence of the algorithm is proved, and numerical results with some practical applications are given to show the efficiency of the algorithm.


2015 ◽  
Vol 11 (1) ◽  
pp. 209-216 ◽  
Author(s):  
Chien-Hao Huang ◽  
Jein-Shan Chen ◽  
Juan Enrique Martinez-Legaz

2009 ◽  
Vol 46 (3) ◽  
pp. 475-485 ◽  
Author(s):  
Sangho Kum ◽  
Yongdo Lim

2020 ◽  
Vol 25 (1) ◽  
pp. 149-174
Author(s):  
Favian E Arenas ◽  
Héctor Jairo Martínez ◽  
Rosana Pérez

In this paper, we present a smoothing of a family of nonlinear complementarity functions and use its properties in combination with the smooth Jacobian strategy to present a new generalized Newton-type algorithm to solve a nonsmooth system of equations equivalent to the Nonlinear Complementarity Problem. In addition, we prove that the algorithm converges locally and q-quadratically, and analyze its numerical performance.


Sign in / Sign up

Export Citation Format

Share Document