An inexact QP-based method for nonlinear complementarity problems (Q1272819)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An inexact QP-based method for nonlinear complementarity problems |
scientific article |
Statements
An inexact QP-based method for nonlinear complementarity problems (English)
0 references
16 June 1999
0 references
A quadratic programming (QP)-based method for nonlinear complementarity problems is considered which allows inexact solutions of the quadratic subproblems. The main features of this method are that all iterates stay in the feasible set and that the method has some strong global and local convergence properties. Numerical results for all complementarity problems from the MCPLIB test problem collection are also reported.
0 references
nonlinear complementarity problems
0 references
inexact solution of quadratic programming subproblems
0 references
convergence
0 references
numerical results
0 references
