Random Gradient-Free Minimization of Convex Functions

In this paper, we prove new complexity bounds for methods of convex optimization based only on computation of the function value. the search directions of our schemes are normally distributed random gaussian vectors. it appears that such methods usually need at most n times more iterations than the standard gradient methods, where n is the dimension of the space of variables. this conclusion is true for both nonsmooth and smooth problems. for the latter class, we present also an accelerated scheme with the expected rate of convergence $$obig ({n^2 over k^2}big )$$ , where k is the iteration counter. for stochastic optimization, we propose a zero-order scheme and justify its expected rate of convergence $$obig ({n over k^{1/2}}big )$$ . we give also some bounds for the rate of convergence of the random gradient-free methods to stationary points of nonconvex functions, for both smooth and nonsmooth cases. our theoretical results are supported by preliminary computational experiments.