i present new stochastic multi-particle models for global optimization of nonconvex functions on the sphere. these models belong to the class of consensus-based optimization methods. in fact, particles move over the manifold driven by a drift towards an instantaneous consensus point, computed as a combination of the particle locations weighted by the cost function according to laplace's principle. the consensus point represents an approximation to a global minimizer. the dynamics is further perturbed by a random vector field to favor exploration, whose variance is a function of the distance of the particles to the consensus point. in particular, as soon as the consensus is reached, then the stochastic component vanishes. in the first part of the talk, i present the well-posedness of the model on the sphere and we derive rigorously its mean-field approximation for large particle limit. \\ \\ in the second part i address the proof of convergence of numerical schemes to global minimizers provided conditions of well-preparation of the initial datum. the proof combines the mean-field limit with a novel asymptotic analysis, and classical convergence results of numerical methods for sde. we present several numerical experiments, which show that the proposed algorithm scales well with the dimension and is extremely versatile. to quantify the performances of the new approach, we show that the algorithm is able to perform essentially as good as ad hoc state of the art methods in challenging problems in signal processing and machine learning, namely the phase retrieval problem and the robust subspace detection. \\ \\ joint work with h. huang, l. pareschi, and p. s"{u}nnen