Abstract
The nonlinear complementarity problem (NCP) has been served as a general framework for linear, quadratic, and nonlinear programming, linear complementarity problem, and some equilibrium problems. Applications of the NCP can be found in many important fields such as economics, mathematical programming, operations research, engineering and mechanics. In this article, we consider smooth NCP on the basis of the square Penalized Fischer-Burmeister function. We show under certain assumptions, any stationary point of the unconstrained minimization problem is already a solution of smooth NCP. Furthermore, a derivative-free descent algorithm is suggested and conditions for its convergence are given. Finally, some preliminary numerical results are presented.
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.
