{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:53:58Z","timestamp":1725512038129},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540793045"},{"type":"electronic","value":"9783540793052"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79305-2_18","type":"book-chapter","created":{"date-parts":[[2008,5,5]],"date-time":"2008-05-05T10:00:35Z","timestamp":1209981635000},"page":"207-218","source":"Crossref","is-referenced-by-count":6,"title":["Log-Linear Convergence and Optimal Bounds for the (1\u2009+\u20091)-ES"],"prefix":"10.1007","author":[{"given":"Mohamed","family":"Jebalia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne","family":"Auger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Liardet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","volume-title":"Evolutionstrategie: Optimierung Technischer Systeme nach Prinzipien der Biologischen Evolution","author":"I. Rechenberg","year":"1973","unstructured":"Rechenberg, I.: Evolutionstrategie: Optimierung Technischer Systeme nach Prinzipien der Biologischen Evolution. Frommann-Holzboog Verlag, Stuttgart (1973)"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/B:NACO.0000023416.59689.4e","volume":"3","author":"S. Kern","year":"2004","unstructured":"Kern, S., M\u00fcller, S., Hansen, N., B\u00fcche, D., Ocenasek, J., Koumoutsakos, P.: Learning Probability Distributions in Continuous Evolutionary Algorithms - A Comparative Review. Natural Computing\u00a03, 77\u2013112 (2004)","journal-title":"Natural Computing"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1162\/106365601750190398","volume":"9","author":"N. Hansen","year":"2001","unstructured":"Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation\u00a09, 159\u2013195 (2001)","journal-title":"Evolutionary Computation"},{"key":"18_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04378-3","volume-title":"The Theory of Evolution Strategies","author":"H.G. Beyer","year":"2001","unstructured":"Beyer, H.G.: The Theory of Evolution Strategies. Springer, Heidelberg (2001)"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0304-3975(03)00284-6","volume":"306","author":"A. Bienven\u00fce","year":"2003","unstructured":"Bienven\u00fce, A., Fran\u00e7ois, O.: Global convergence for evolution strategies in spherical problems: some simple proofs and difficulties. Theoretical Computer Science\u00a0306, 269\u2013289 (2003)","journal-title":"Theoretical Computer Science"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2004.11.017","volume":"334","author":"A. Auger","year":"2005","unstructured":"Auger, A.: Convergence results for (1,\u03bb)-SA-ES using the theory of \u03d5-irreducible Markov chains. Theoretical Computer Science\u00a0334, 35\u201369 (2005)","journal-title":"Theoretical Computer Science"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Auger, A., Hansen, N.: Reconsidering the progress rate theory for evolution strategies in finite dimensions. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2006), pp. 445\u2013452 (2006)","DOI":"10.1145\/1143997.1144081"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/11844297_3","volume-title":"Parallel Problem Solving from Nature - PPSN IX","author":"O. Teytaud","year":"2006","unstructured":"Teytaud, O., Gelly, S.S.: General lower bounds for evolutionary algorithms. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guerv\u00f3s, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol.\u00a04193, pp. 21\u201331. Springer, Heidelberg (2006)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-74871-7_11","volume-title":"Stochastic Algorithms: Foundations and Applications","author":"J. J\u00e4gersk\u00fcpper","year":"2007","unstructured":"J\u00e4gersk\u00fcpper, J.: Lower bounds for hit-and-run direct search. In: Hromkovi\u010d, J., Kr\u00e1lovi\u010d, R., Nunkesser, M., Widmayer, P. (eds.) SAGA 2007. LNCS, vol.\u00a04665, pp. 118\u2013129. Springer, Heidelberg (2007)"},{"key":"18_CR10","volume-title":"Probability Theory","author":"M. Lo\u00e8ve","year":"1963","unstructured":"Lo\u00e8ve, M.: Probability Theory, 3rd edn. Van Nostrand, New York (1963)","edition":"3"}],"container-title":["Lecture Notes in Computer Science","Artificial Evolution"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79305-2_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:16:48Z","timestamp":1619522208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79305-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540793045","9783540793052"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79305-2_18","relation":{},"subject":[]}}