Basic results on the convergence and convergence rates of random search methods are presented. Moreover, for the improvement of the – sometimes very low – convergence rate of RSM, search methods based on optimal stochastic decision processes are presented. In order to improve the convergence behavior of RSM, the random search procedure is embedded into a stochastic decision process for an optimal control of the probability distributions of the search variates (mutation random variables).