In this paper, a new pattern search is proposed to solve the systems of nonlinear equations. We introduce a new nonmonotone strategy which includes a convex combination of the maximum function of some preceding successful iterates and the current function. First, we produce a stronger nonmonotone strategy in relation to the generated strategy by Gasparo et al. [13] whenever iterates are far away from the optimizer. Second, when iterates are near the optimizer, we produce a weaker nonmonotone strategy with respect to the generated strategy by Ahookhosh et al. [1]. Third, whenever iterates are neither near the optimizer nor far away from it, we produce a medium nonmonotone strategy which will be laid between the generated strategy by Gasparo et al. [13] and Ahookhosh et al. [ 1]. Reported are numerical results of the proposed algorithm for which the global convergence is established.
