Convergence of a penalty method for mathematical programming with complementarity constraints

We adapt the convergence analysis of the smoothing and regularization methods to a penalty framework for mathematical programs with complementarity constraints (MPCC); we show that the penalty framework shares convergence properties similar to those of these methods. Moreover, we give sufficient conditions for a sequence generated by the penalty framework to be attracted to a B-stationary point of the MPCC.