Derivative-free methods for monotone variational inequality and complementarity problems

Monotone variational inequality problems with box constraints and complementarity problems are reformulated as simple-bound optimization problems. Some derivative-free methods for these problems are proposed. It is shown that, for these new methods, the updated point sequence remains feasible with respect to its simple constraints if the initial point is feasible. Under certain conditions, these methods are globally convergent.