A new exclusion test for finding the global minimum

Abstract: Exclusion algorithms have been used recently to find all solutions of a system of nonlinear equations or to find the global minimum of a function over a compact domain. These algorithms are based on a minimization condition that can be applied to each cell in the domain. In this paper, we consider Lipschitz functions of order and give a new minimization condition for the exclusion algorithm. Furthermore, convergence and complexity results are presented for such algorithm. [Copyright &y& Elsevier]