We investigate the theoretical and numerical properties of two global optim
ization techniques for the solution of mixed complementarity problems. More
precisely, using a standard semismooth Newton-type method as a basic solve
r for complementarity problems, we describe how the performance of this met
hod can be improved by incorporating two well-known global optimization alg
orithms, namely a tunneling and a filled function method. These methods are
tested and compared with each other on a couple of very difficult test exa
mples.