{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:14:16Z","timestamp":1726409656014},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319458229"},{"type":"electronic","value":"9783319458236"}],"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_10","type":"book-chapter","created":{"date-parts":[[2016,8,30]],"date-time":"2016-08-30T09:26:31Z","timestamp":1472549191000},"page":"101-110","source":"Crossref","is-referenced-by-count":4,"title":["Lyapunov Design of a Simple Step-Size Adaptation Strategy Based on Success"],"prefix":"10.1007","author":[{"given":"Claudia R.","family":"Correa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elizabeth F.","family":"Wanner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos M.","family":"Fonseca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,31]]},"reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"crossref","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. Evol. Comput. 9(2), 159\u2013195 (2001)","journal-title":"Evol. Comput."},{"key":"10_CR2","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 2015 ACM-GECCO Genetic and Evolutionary Computation Conference, pp. 1335\u20131342. ACM (2015)","DOI":"10.1145\/2739480.2754684"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C.: A tight runtime analysis of the $$(1+(\\lambda ,\\lambda ))$$ genetic algorithm on onemax. In: Proceedings of the 2015 ACM-GECCO Genetic and Evolutionary Computation Conference, pp. 1423\u20131430. ACM (2015)","DOI":"10.1145\/2739480.2754683"},{"key":"10_CR4","unstructured":"Wanner, E.F., Fonseca, C.M., Cardoso, R.T.N., Takahashi, R.H.C.: Lyapunov stability analysis and adaptation law synthesis of a derandomized self-adaptive $$(1,2)$$ -ES. Under review"},{"issue":"4","key":"10_CR5","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1162\/106365603322519279","volume":"11","author":"MA Semenov","year":"2003","unstructured":"Semenov, M.A., Terkel, D.A.: Analysis of convergence of an evolutionary algorithm with self-adaptation using a stochastic Lyapunov function. Evol. Comput. 11(4), 363\u2013379 (2003)","journal-title":"Evol. Comput."},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-540-87700-4_5","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN X","author":"J J\u00e4gersk\u00fcpper","year":"2008","unstructured":"J\u00e4gersk\u00fcpper, J.: A blend of Markov-chain and drift analysis. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 41\u201351. Springer, Heidelberg (2008)"},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0004-3702(01)00058-3","volume":"127","author":"J He","year":"2001","unstructured":"He, J., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Artif. Intell. 127, 57\u201385 (2001)","journal-title":"Artif. Intell."},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/B:NACO.0000023417.31393.c7","volume":"3","author":"J He","year":"2004","unstructured":"He, J., Yao, X.: A study of drift analysis for estimating computational time of evolutionary algorithms. Natural Comput. 3, 21\u201335 (2004)","journal-title":"Natural Comput."},{"issue":"4","key":"10_CR9","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1007\/s00453-012-9622-x","volume":"64","author":"B Doerr","year":"2011","unstructured":"Doerr, B., Johannsen, D., Winzen, C.: Multiplicative drift analysis. Algorithmica 64(4), 673\u2013697 (2011)","journal-title":"Algorithmica"},{"issue":"02","key":"10_CR10","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1017\/S0963548312000600","volume":"22","author":"C Witt","year":"2013","unstructured":"Witt, C.: Tight bounds on the optimization time of a randomized search heuristic on linear function. Comb. Probab. Comput. 22(02), 294\u2013318 (2013)","journal-title":"Comb. Probab. Comput."},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s00500-004-0376-5","volume":"9","author":"WE Hart","year":"2002","unstructured":"Hart, W.E.: Rethinking the design of real-coded evolutionary algorithms: making discrete choices in continuous search domains. Soft Comput. J. 9, 225\u2013235 (2002)","journal-title":"Soft Comput. J."},{"issue":"3","key":"10_CR12","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1080\/00207179208934253","volume":"55","author":"AM Lyapunov","year":"1992","unstructured":"Lyapunov, A.M.: The general problem of stability of motion (reprint of the original paper of 1892). Int. J. Control 55(3), 531\u2013773 (1992)","journal-title":"Int. J. Control"},{"key":"10_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-50085-5","volume-title":"Stability of Motion","author":"W Hahn","year":"1967","unstructured":"Hahn, W.: Stability of Motion. Springer, Heidelberg (1967)"},{"key":"10_CR14","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S Janson","year":"2000","unstructured":"Janson, S., Luczak, T., Rucinski, A.: Random Graphs. Wiley, Hoboken (2000)"}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:38:44Z","timestamp":1498325924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45823-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319458229","9783319458236"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45823-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}