Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. United States Department of Commerce, National Bureau of Standards, 1972. ,
The Gamma Function, 1964. ,
Analysis of Generalized Pattern Searches, SIAM Journal on Optimization, vol.13, issue.3, pp.889-903, 2002. ,
DOI : 10.1137/S1052623400378742
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.9386
Mesh Adaptive Direct Search Algorithms for Constrained Optimization, SIAM Journal on Optimization, vol.17, issue.1, pp.188-217, 2006. ,
DOI : 10.1137/040603371
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.413.9526
Convergence of Trust-Region Methods Based on Probabilistic Models, SIAM Journal on Optimization, vol.24, issue.3, pp.1238-1264, 2014. ,
DOI : 10.1137/130915984
Introduction to Derivative-Free Optimization, MPS- SIAM Series on Optimization. SIAM, 2009. ,
DOI : 10.1137/1.9780898718768
Using Sampling and Simplex Derivatives in Pattern Search Methods, SIAM Journal on Optimization, vol.18, issue.2, pp.537-555, 2007. ,
DOI : 10.1137/050646706
Theory of Positive Linear Dependence, American Journal of Mathematics, vol.76, issue.4, pp.733-746, 1954. ,
DOI : 10.2307/2372648
A derivative-free nonmonotone line-search technique for unconstrained optimization, Journal of Computational and Applied Mathematics, vol.219, issue.2, pp.383-397, 2008. ,
DOI : 10.1016/j.cam.2007.07.017
URL : http://doi.org/10.1016/j.cam.2007.07.017
Globally convergent evolution strategies, Mathematical Programming, vol.133, issue.1-2 ,
DOI : 10.1007/s10107-014-0793-x
URL : https://hal.archives-ouvertes.fr/hal-01391780
Worst case complexity of direct search under convexity, Mathematical Programming, vol.1, issue.1-2 ,
DOI : 10.1007/s10107-014-0847-0
Analyzing Randomized Search Heuristics: Tools from Probability Theory, Theory of Randomized Search Heuristics: Foundations and Recent Developments of Series on Theoretical Computer Science, pp.1-20, 2011. ,
DOI : 10.1142/9789814282673_0001
On the Local Convergence of Pattern Search, SIAM Journal on Optimization, vol.14, issue.2, pp.567-583, 2003. ,
DOI : 10.1137/S1052623400374495
Concentration of Measure for the Analysis of Randomized Algorithms, 2009. ,
DOI : 10.1017/CBO9780511581274
Probability: Theory and Examples. Cambridge Series in Statistical and Probabilistic Mathematics, 2010. ,
DOI : 10.1017/CBO9780511779398
CUTEr and SifDec, ACM Transactions on Mathematical Software, vol.29, issue.4, pp.373-394, 2003. ,
DOI : 10.1145/962437.962439
A Merit Function Approach for Direct Search, SIAM Journal on Optimization, vol.24, issue.4, 1980. ,
DOI : 10.1137/130917661
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.417.7555
Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation, Proceedings of IEEE International Conference on Evolutionary Computation, pp.312-317, 1996. ,
DOI : 10.1109/ICEC.1996.542381
Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods, SIAM Review, vol.45, issue.3, pp.385-482, 2003. ,
DOI : 10.1137/S003614450242889
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.80.5262
A note on a method for generating points uniformly on n-dimensional spheres, Communications of the ACM, vol.2, issue.4, pp.19-20, 1959. ,
DOI : 10.1145/377939.377946
Random Gradient-Free Minimization of Convex Functions, Foundations of Computational Mathematics, vol.66, issue.2, 2011. ,
DOI : 10.1007/s10208-015-9296-2
Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems, SIAM Journal on Optimization, vol.22, issue.2, pp.341-362, 2012. ,
DOI : 10.1137/100802001
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.332.3336
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function, Mathematical Programming, vol.67, issue.1, pp.1-38, 2014. ,
DOI : 10.1007/s10107-012-0614-z
Introduction to Optimization, 1987. ,
On the Convergence of Pattern Search Algorithms, SIAM Journal on Optimization, vol.7, issue.1, pp.1-25, 1997. ,
DOI : 10.1137/S1052623493250780
Worst case complexity of direct search, EURO Journal on Computational Optimization, vol.133, issue.1-2, pp.143-153, 2013. ,
DOI : 10.1007/s13675-012-0003-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.414.2786
Analysis of direct searches for discontinuous functions, Mathematical Programming, vol.7, issue.1-2, pp.299-325, 2012. ,
DOI : 10.1007/s10107-010-0429-8