Learn More
In the paper [4], the authors proposed a derivative-free descent algorithm for the nonlinear complementarity problems (NCPs) by the generalized Fischer-Burmeister merit function: ψ p (a, b) = 1 2 [∥(a, b)∥ p − (a + b)] 2 , and observed that the choice of the parameter p has a great influence on the numerical performance of the algorithm. In this paper, we(More)
  • 1