摘要

We propose a smoothing Newton algorithm for solving mathematical programs with complementarity constraints (MPCCS). Under some reasonable conditions, the proposed algorithm is shown to be globally convergent and to generate a B-stationary point of the MPCC. Preliminary numerical results on some MacMPEC problems are reported.