Comparison of three random search methods

Three recent random search algorithms are compared on the basis of efficiency, and on the basis of sensitivity to noise, scaling and the number of variables. A general discussion of random search methods points out their advantages and disadvantages in relation to deterministic methods. A new random vector generator is described in the appendix.Applied Science, Faculty ofElectrical and Computer Engineering, Department ofGraduat