A class of smoothing methods for mathematical programs with complementarity constraints
A class of smoothing methods to solve mathematical programs with complementarity constraints is developed, and the convergence property is analyzed. The author shows that the linear independence constraint qualification holds for this class of smoothing methods under some conditions. The properties of the accumulated points of this class are analyzed, and the convergence properties are established under some conditions.
scientific article; zbMATH DE number 5146975