Solving non-linear complementarity problem by a derivative-free descent method (Q545211)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving non-linear complementarity problem by a derivative-free descent method |
scientific article |
Statements
Solving non-linear complementarity problem by a derivative-free descent method (English)
0 references
22 June 2011
0 references
Summary: 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.
0 references
NCP
0 references
non-linear complementarity problem
0 references
unconstrained minimisation
0 references
NCP function
0 references
merit functions
0 references
descent algorithm
0 references
