Solving non-linear complementarity problem by a derivative-free descent method
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.
- Some research o derivative-free descent method for nonlinear complementarity problem
- scientific article; zbMATH DE number 1569004
- scientific article; zbMATH DE number 1507133
- A descent Newton method for solving nonlinear complementarity problem with P₀-function
- Merit functions for nonsmooth complementarity problems and related descent algorithms
- A derivative-free filter method for solving nonlinear complementarity problems
- The linear convergence of a derivative-free descent method for nonlinear complementarity problems
- Some research o derivative-free descent method for nonlinear complementarity problem
- scientific article; zbMATH DE number 1507133 (Why is no real title available?)
- scientific article; zbMATH DE number 1569004 (Why is no real title available?)
- Solution point characterizations and convergence analysis of a descent algorithm for nonsmooth continuous complementarity problems.
This page was built for publication: Solving non-linear complementarity problem by a derivative-free descent method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545211)