Abstract
Some modifications are suggested to the controlled random search algorithm for global optimization. Numerical experiments indicate that the resulting algorithms are considerably better than the originals and offer a reasonable alternative to many currently available stochastic algorithms, especially for problems requiring ‘direct search’ type methods.