Abstract
ABSTRACTIn this paper, based on the 3-1 piecewise nonlinear complementarity problem (NCP) function, we proposed a smoothing Newton-type method for the generalized nonlinear complementarity problem (GNCP) with a modified non-monotone line search. The algorithm for a GNCP is more difficult than that for an NCP, because two functions must be considered in the problem. We reformulate the (GNCP) to a smoothing system of equations by two independent variables, and then develop a smoothing Newton-type method for solving it. Under reasonable conditions, we obtain the global convergent properties. Also, the numerical experiments are reported in this paper.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
