{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:02:58Z","timestamp":1777449778049,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540389903","type":"print"},{"value":"9783540389910","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11844297_3","type":"book-chapter","created":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T18:55:37Z","timestamp":1160074537000},"page":"21-31","source":"Crossref","is-referenced-by-count":39,"title":["General Lower Bounds for Evolutionary Algorithms"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Teytaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Gelly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Auger, A.: Convergence results for (1,\u03bb)-SA-ES using the theory of \u03d5-irreducible markov chains. Theoretical Computer Science (in press, 2005)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Auger, A., Jebalia, M., Teytaud, O.: Xse: quasi-random mutations for evolution strategies. In: Proceedings of Evolutionary Algorithms, pages 12 (2005)","DOI":"10.1007\/11740698_26"},{"key":"3_CR3","volume-title":"A probabilistic Theory of Pattern Recognition","author":"L. Devroye","year":"1997","unstructured":"Devroye, L., Gy\u00f6rfi, L., Lugosi, G.: A probabilistic Theory of Pattern Recognition. Springer, Heidelberg (1997)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Droste, S.: Not all linear functions are equally difficult for the compact genetic algorithm. In: Proc. of the Genetic and Evolutionary Computation COnference (GECCO 2005), pp. 679\u2013686 (2005)","DOI":"10.1145\/1068009.1068124"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Droste, S., Jansen, T., Wegener, I.: Upper and lower bounds for randomized search heuristics in black-box optimization (2003)","DOI":"10.1007\/s00224-004-1177-z"},{"key":"3_CR6","volume-title":"An introduction to Probability Theory and its Applications","author":"W. Feller","year":"1968","unstructured":"Feller, W.: An introduction to Probability Theory and its Applications. Wiley, Chichester (1968)"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1145\/321062.321069","volume":"8","author":"R. Hooke","year":"1961","unstructured":"Hooke, R., Jeeves, T.A.: Direct search solution of numerical and statistical problems. Journal of the ACM\u00a08, 212\u2013229 (1961)","journal-title":"Journal of the ACM"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Jagerskupper, J., Witt, C.: Runtime analysis of a (mu+1)es for the sphere function. Technical report (2005)","DOI":"10.1145\/1068009.1068153"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"J. Nelder","year":"1965","unstructured":"Nelder, J., Mead, R.: A simplex method for function minimization. Computer Journal\u00a07, 308\u2013311 (1965)","journal-title":"Computer Journal"},{"issue":"3","key":"3_CR10","first-page":"375","volume":"26","author":"G. Rudolph","year":"1997","unstructured":"Rudolph, G.: Convergence rates of evolutionary algorithms for a class of convex objective functions. Control and Cybernetics\u00a026(3), 375\u2013390 (1997)","journal-title":"Control and Cybernetics"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Teytaud, O., Gelly, S., Mary, J.: On the ultimate convergence rates for isotropic algorithms and the best choices among various forms of isotropy, ppsn (2006)","DOI":"10.1007\/11844297_4"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature - PPSN IX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/11844297_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T01:04:30Z","timestamp":1664240670000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/11844297_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540389903","9783540389910"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11844297_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}