{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,17]],"date-time":"2026-09-17T20:17:32Z","timestamp":1789676252329,"version":"4.0.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319458229","type":"print"},{"value":"9783319458236","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45823-6_73","type":"book-chapter","created":{"date-parts":[[2016,8,30]],"date-time":"2016-08-30T09:26:31Z","timestamp":1472549191000},"page":"782-791","source":"Crossref","is-referenced-by-count":7,"title":["Provably Optimal Self-adjusting Step Sizes for Multi-valued Decision Variables"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carola","family":"Doerr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Timo","family":"K\u00f6tzing","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,31]]},"reference":[{"key":"73_CR1","doi-asserted-by":"crossref","DOI":"10.1142\/7438","volume-title":"Theory of Randomized Search Heuristics","author":"A Auger","year":"2011","unstructured":"Auger, A., Doerr, B.: Theory of Randomized Search Heuristics. World Scientific, Singapore (2011)"},{"key":"73_CR2","unstructured":"Auger, A., Hansen, N.: Linear convergence on positively homogeneous functions of a comparison based step-size adaptive randomized search: the (1+1) ES with generalized one-fifth success rule. CoRR, abs\/1310.8397 (2013). http:\/\/arxiv.org\/abs\/1310.8397"},{"key":"73_CR3","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"S B\u00f6ttcher","year":"2010","unstructured":"B\u00f6ttcher, S., Doerr, B., Neumann, F.: Optimal fixed and adaptive mutation rates for the leadingones problem. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6238, pp. 1\u201310. Springer, Heidelberg (2010)"},{"key":"73_CR4","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1017\/S0963548309990599","volume":"19","author":"M Dietzfelbinger","year":"2010","unstructured":"Dietzfelbinger, M., Rowe, J.E., Wegener, I., Woelfel, P.: Tight bounds for blind search on the integers and the reals. Comb. Probab. Comput. 19, 711\u2013728 (2010)","journal-title":"Comb. Probab. Comput."},{"key":"73_CR5","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C.: Optimal parameter choices through self-adjustment: applying the 1\/5-th rule in discrete settings. In: Proceedings of the ACM Genetic and Evolutionary Computation Conference (GECCO 2015), pp. 1335\u20131342. ACM (2015)","DOI":"10.1145\/2739480.2754684"},{"key":"73_CR6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.tcs.2014.11.028","volume":"567","author":"B Doerr","year":"2015","unstructured":"Doerr, B., Doerr, C., Ebel, F.: From black-box complexity to designing newgenetic algorithms. Theor. Comput. Sci. 567, 87\u2013104 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"73_CR7","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., K\u00f6tzing, T.: The right mutation strength for multi-valued decision variables. In: Proceedings of the ACM Genetic and Evolutionary Computation Conference (GECCO 2016). ACM (2016, to appear). http:\/\/arxiv.org\/abs\/1604.03277","DOI":"10.1145\/2908812.2908891"},{"key":"73_CR8","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., Yang, J.: Optimal parameter choices via precise black-box analysis. In: Proceedings of the ACM Genetic and Evolutionary Computation Conference (GECCO 2016). ACM (2016, to appear)","DOI":"10.1145\/2908812.2908950"},{"key":"73_CR9","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/s00453-011-9585-3","volume":"65","author":"B Doerr","year":"2013","unstructured":"Doerr, B., Goldberg, L.A.: Adaptive drift analysis. Algorithmica 65, 224\u2013250 (2013)","journal-title":"Algorithmica"},{"key":"73_CR10","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1007\/s00453-012-9622-x","volume":"64","author":"B Doerr","year":"2012","unstructured":"Doerr, B., Johannsen, D., Winzen, C.: Multiplicative drift analysis. Algorithmica 64, 673\u2013697 (2012)","journal-title":"Algorithmica"},{"key":"73_CR11","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/s00224-004-1177-z","volume":"39","author":"S Droste","year":"2006","unstructured":"Droste, S., Jansen, T., Wegener, I.: Upper and lower bounds for randomized search heuristics in black-box optimization. Theor. Comput. Syst. 39, 525\u2013544 (2006)","journal-title":"Theor. Comput. Syst."},{"key":"73_CR12","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/4235.771166","volume":"3","author":"AE Eiben","year":"1999","unstructured":"Eiben, A.E., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary. IEEE Trans. Evol. Comput. 3, 124\u2013141 (1999)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"73_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05094-1","volume-title":"Introduction to Evolutionary Computing","author":"AE Eiben","year":"2003","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Springer, Heidelberg (2003)"},{"key":"73_CR14","doi-asserted-by":"crossref","unstructured":"Hansen, N., Gawelczyk, A., Ostermeier, A.: Sizing the population with respect to the local progress in (1, $$ \\lambda $$ )-evolution strategies - a theoretical analysis. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 1995), pp. 80\u201385. IEEE (1995)","DOI":"10.1109\/ICEC.1995.489123"},{"key":"73_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/11513575_14","volume-title":"Foundations of Genetic Algorithms","author":"J J\u00e4gersk\u00fcpper","year":"2005","unstructured":"J\u00e4gersk\u00fcpper, J.: Rigorous runtime analysis of the (1+1) ES: 1\/5-rule and ellipsoidal fitness landscapes. In: Wright, A.H., Vose, M.D., De Jong, K.A., Schmitt, L.M. (eds.) FOGA 2005. LNCS, vol. 3469, pp. 260\u2013281. Springer, Heidelberg (2005)"},{"key":"73_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/978-3-540-87744-8_46","volume-title":"Algorithms - ESA 2008","author":"J J\u00e4gersk\u00fcpper","year":"2008","unstructured":"J\u00e4gersk\u00fcpper, J.: Oblivious randomized direct search for real-parameter optimization. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 553\u2013564. Springer, Heidelberg (2008)"},{"key":"73_CR17","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1109\/TEVC.2014.2308294","volume":"19","author":"G Karafotias","year":"2015","unstructured":"Karafotias, G., Hoogendoorn, M., Eiben, A.: Parameter control in evolutionary algorithms: trends and challenges. IEEE Trans. Evol. Comput. 19, 167\u2013187 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"73_CR18","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1007\/s00453-015-0048-0","volume":"75","author":"T K\u00f6tzing","year":"2016","unstructured":"K\u00f6tzing, T.: Concentration of first hitting times under additive drift. Algorithmica 75, 490\u2013506 (2016)","journal-title":"Algorithmica"},{"key":"73_CR19","doi-asserted-by":"crossref","unstructured":"L\u00e4ssig, J., Sudholt, D.: Adaptive population models for offspring populations and parallel evolutionary algorithms. In: Proceedings of the ACM Workshop on Foundations of Genetic Algorithms (FOGA 2011), pp. 181\u2013192. ACM (2011)","DOI":"10.1145\/1967654.1967671"},{"key":"73_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/3-540-58484-6_258","volume-title":"Proceedings of the Conference on Parallel Problem Solving from Nature (PPSN 1994)","author":"G Rudolph","year":"1994","unstructured":"Rudolph, G.: An evolutionary algorithm for integer programming. In: Davidor, Y., Schwefel, H.-P., M\u00f6nner, R. (eds.) (PPSN 1994). LNCS, pp. 139\u2013148. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XIV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45823-6_73","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:38:54Z","timestamp":1498325934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45823-6_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319458229","9783319458236"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45823-6_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}