  A new pattern search method for bound constrained optimization is introduced.
The proposed algorithm employs the coordinate directions, in a suitable way,
with a nonmonotone line search for accepting the new iterate, without using
derivatives of the objective function. The main global convergence results are
strongly based on the relationship between the step length and a stationarity
measure. Several numerical experiments are performed using a well known set of
test problems. Other line search strategies were tested and compared with the
new algorithm.
