, optimum: practically, they are local (although CMA-ES is asymptotically convergent to the global optimum and Nelder-Mead may go over regions of attraction to local optima)

, CMA-ES at convergence (possibly force a few early convergences for restarts

L. Riche,

A. Auger and N. Hansen, Linear convergence of comparison-based step-size adaptive randomized search via stability of markov chains, SIAM Journal on Optimization, vol.26, issue.3, pp.1589-1624, 2016.
URL : https://hal.archives-ouvertes.fr/hal-00877160

A. R. Conn, K. Scheinberg, and L. N. Vicente, Introduction to Derivative-Free Optimization, Society for Industrial and Applied Mathematics, 2009.

N. Hansen, The CMA Evolution Strategy: A Tutorial, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01297037

N. Hansen and A. Ostermeier, Adapting arbitrary normal mutation distributions in evolution strategies: The covariance matrix adaptation, pp.312-317, 1996.

N. Hansen and A. Ostermeier, Completely derandomized self-adaptation in evolution strategies, Evol. Comput, vol.9, issue.2, pp.159-195, 2001.

G. Steven and . Johnson, The NLopt nonlinear-optimization package, 2011.

D. R. Jones, M. Schonlau, and W. J. Welch, Efficient global optimization of expensive black-box functions, Journal of Global optimization, vol.13, issue.4, pp.455-492, 1998.

J. C. Lagarias, J. A. Reeds, M. H. Wright, and P. E. Wright, Convergence properties of the Nelder-Mead simplex method in low dimensions, SIAM Journal on Optimization, vol.9, issue.1, pp.112-147, 1998.

I. Loshchilov, Cma-es with restarts for solving cec 2013 benchmark problems, IEEE Congress on Evolutionary Computation, pp.369-376, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00823880

I. Loshchilov, M. Schoenauer, and M. Sebag, Intensive Surrogate Model Exploitation in Self-adaptive Surrogate-assisted CMA-ES (saACM-ES)
URL : https://hal.archives-ouvertes.fr/hal-00818595

, Genetic and Evolutionary Computation Conference (GECCO 2013), pp.439-446, 2013.

A. Marco, R. Luersen, and . Le-riche, Globalized nelder-mead method for engineering optimization, Computers & Structures, vol.82, issue.23, pp.2251-2260, 2004.

I. M. Ken and . Mckinnon, Convergence of the nelder-mead simplex method to a nonstationary point, SIAM Journal on Optimization, vol.9, issue.1, pp.148-158, 1998.

H. Mohammadi, R. L. Riche, and E. Touboul, Making EGO and CMA-ES Complementary for Global Optimization, Learning and Intelligent Optimization, vol.8994, pp.287-292, 2015.
URL : https://hal.archives-ouvertes.fr/emse-01168512

J. A. Nelder and R. Mead, A simplex method for function minimization, The Computer Journal, vol.7, issue.4, pp.308-313, 1965.

Y. Ollivier, L. Arnold, A. Auger, and N. Hansen, Information-geometric optimization algorithms: A unifying picture via invariance principles, Journal of Machine Learning Research, 2017.
URL : https://hal.archives-ouvertes.fr/hal-00601503

P. Tseng, Fortified-descent simplicial search method: A general approach, SIAM J. Optim, vol.10, pp.269-288, 1999.

L. Riche, CNRS EMSE) Optimization without metamodel 38/38 March, vol.38, p.38, 2018.