{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:41:00Z","timestamp":1764783660837},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319107615"},{"type":"electronic","value":"9783319107622"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10762-2_6","type":"book-chapter","created":{"date-parts":[[2014,9,10]],"date-time":"2014-09-10T14:58:55Z","timestamp":1410361135000},"page":"60-69","source":"Crossref","is-referenced-by-count":13,"title":["How to Assess Step-Size Adaptation Mechanisms in Randomised Search"],"prefix":"10.1007","author":[{"given":"Nikolaus","family":"Hansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asma","family":"Atamna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne","family":"Auger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/11513575_12","volume-title":"Foundations of Genetic Algorithms","author":"D.V. Arnold","year":"2005","unstructured":"Arnold, D.V.: Optimal weighted recombination. In: Wright, A.H., Vose, M.D., De Jong, K.A., Schmitt, L.M. (eds.) FOGA 2005. LNCS, vol.\u00a03469, pp. 215\u2013237. Springer, Heidelberg (2005)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Auger, A., Hansen, N.: Reconsidering the progress rate theory for evolution strategies in finite dimensions. In: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp. 445\u2013452. ACM (2006)","DOI":"10.1145\/1143997.1144081"},{"key":"6_CR3","unstructured":"Auger, A., Hansen, N.: On Proving Linear Convergence of Comparison-based Step-size Adaptive Randomized Search on Scaling-Invariant Functions via Stability of Markov Chains (2013) ArXiv eprint"},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1109\/4235.930314","volume":"5","author":"H.-G. Beyer","year":"2001","unstructured":"Beyer, H.-G., Deb, K.: On self-adaptive features in real-parameter evolutionary algorithms. IEEE Transactions on Evolutionary Computation\u00a05(3), 250\u2013270 (2001)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-15844-5_2","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"D. Brockhoff","year":"2010","unstructured":"Brockhoff, D., Auger, A., Hansen, N., Arnold, D.V., Hohm, T.: Mirrored sampling and sequential selection for evolution strategies. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol.\u00a06238, pp. 11\u201321. Springer, Heidelberg (2010)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Glasmachers, T., Schaul, T., Yi, S., Wierstra, D., Schmidhuber, J.: Exponential natural evolution strategies. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pp. 393\u2013400. ACM (2010)","DOI":"10.1145\/1830483.1830557"},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1162\/evco.2006.14.3.255","volume":"14","author":"N. Hansen","year":"2006","unstructured":"Hansen, N.: An analysis of mutative \u03c3-self-adaptation on linear fitness functions. Evolutionary Computation\u00a014(3), 255\u2013275 (2006)","journal-title":"Evolutionary Computation"},{"key":"6_CR8","unstructured":"Hansen, N.: CMA-ES with two-point step-size adaptation. CoRR, abs\/0805.0231 (2008)"},{"key":"6_CR9","unstructured":"Hansen, N.: The CMA evolution strategy: A tutorial (2011)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-540-30217-9_29","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"N. Hansen","year":"2004","unstructured":"Hansen, N., Kern, S.: Evaluating the CMA evolution strategy on multimodal test functions. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guerv\u00f3s, J.J., Bullinaria, J.A., Rowe, J.E., Ti\u0148o, P., Kab\u00e1n, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol.\u00a03242, pp. 282\u2013291. Springer, Heidelberg (2004)"},{"issue":"2","key":"6_CR11","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(2), 159\u2013195 (2001)","journal-title":"Evolutionary Computation"},{"issue":"8","key":"6_CR12","doi-asserted-by":"publisher","first-page":"5755","DOI":"10.1016\/j.asoc.2011.03.001","volume":"11","author":"N. Hansen","year":"2011","unstructured":"Hansen, N., Ros, R., Mauny, N., Schoenauer, M., Auger, A.: Impacts of invariance in search: When CMA-ES and PSO face ill-conditioned and non-separable problems. Applied Soft Computing\u00a011(8), 5755\u20135769 (2011)","journal-title":"Applied Soft Computing"},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1109\/4235.728207","volume":"2","author":"R. Salomon","year":"1998","unstructured":"Salomon, R.: Evolutionary algorithms and gradient search: Similarities and differences. IEEE Transactions on Evolutionary Computation\u00a02(2), 45\u201355 (1998)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"6_CR14","volume-title":"Sixth-Generation Computer Technology","author":"H.-P. Schwefel","year":"1995","unstructured":"Schwefel, H.-P.: Evolution and Optimum Seeking. In: Sixth-Generation Computer Technology, Wiley Interscience, New York (1995)"},{"key":"6_CR15","unstructured":"http:\/\/hal.inria.fr\/hal-00997294"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XIII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10762-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T21:22:04Z","timestamp":1558992124000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10762-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319107615","9783319107622"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10762-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}