Abstract
We present an introduction to a class of smoothing methods for complementarity problems and their applications. We first discuss the features that characterize the smoothing methods for complementarity problems. We then outline the algorithms and convergence analysis. We finally give a brief view of smoothing methods for variational inequalities, semi-infinite programs, constrained optimization problems and mathematical programming with equilibrium constraints.
