Solving non-linear complementarity problem by a derivative-free descent method

Mohamed A. Tawhid

International Journal of Operational Research, 2011, vol. 10, issue 3, 361-375

Abstract: The non-linear complementarity problem (NCP) has many important applications in operations research, economic equilibrium, models, mathematical programming, engineering and mechanics. In this paper, we consider smooth NCP on the basis of the square Kanzow–Kleinmichel function. We show under certain assumptions, any stationary point of the unconstrained minimisation problem is already a solution of smooth NCP. Also, we suggest a derivative-free descent algorithm and give conditions for its convergence. Furthermore, we present some preliminary numerical results.

Keywords: smooth NCP; nonlinear complementarity problem; unconstrained minimisation; NCP functions; merit functions; descent algorithms. (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=38906 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:10:y:2011:i:3:p:361-375

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().