Abstract
In this paper we deal with the numerical experiments of two smoothing descent-type algorithms for solving nonlinear complementarity problems (NCP). The first algorithm is due to Kanzow and the second one is due to Peng. These algorithms are both based on the reformulation of (NCP) as unconstrained minimization problems by using some smoothing merit functions including the so-called (NCP)-functions. Under suitable conditions they both showed that any stationary point of these problems are solutions of (NCP). For their numerical performances many strategies are used. Finally, these algorithms are applied to some problems of (NCP) found in the literature.
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 callMore From: Journal of Numerical Analysis and Approximation Theory
Disclaimer: 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.
