## Complementarity constraints as nonlinear equations: Theory and numerical experience (2003)

Venue: | Preprint ANL/MCS-P1054-0603, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne |

Citations: | 10 - 3 self |

### BibTeX

@INPROCEEDINGS{Leyffer03complementarityconstraints,

author = {Sven Leyffer},

title = {Complementarity constraints as nonlinear equations: Theory and numerical experience},

booktitle = {Preprint ANL/MCS-P1054-0603, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne},

year = {2003},

pages = {169--208},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

Recently, it has been shown that mathematical programs with complementarity constraints (MPCCs) can be solved efficiently and reliably as nonlinear programs. This paper examines various nonlinear formulations of the complementarity constraints. Several nonlinear complementarity functions are considered for use in MPCC. Unlike standard smoothing techniques, however, the reformulations do not require the control of a smoothing parameter. Thus they have the advantage that the smoothing is exact in the sense that Karush-Kuhn-Tucker points of the reformulation correspond to strongly stationary points of the MPCC. A new exact smoothing of the well-known min function is also introduced and shown to possess desirable theoretical properties. It is shown how the new formulations can be integrated into a sequential quadratic programming solver, and their practical performance is compared on a range of test problems.