2001•Or TransactionsRequires access
A Descent Algorithm for Solving Nonlinear Complementarity Problem
Hangyu Wang
Open publisher page 0 citations
Abstract
In [1], nonlinear complementarity problem was reformulated as a nonnegative constrained optimization problem by Solodov. Based on this reformulation, we present in this paper a descent algorithm for solving nonlinear complementarity problem and its global convergence is proved under the condition that the underlying mapping is strongly monotone.