{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T23:24:43Z","timestamp":1790378683569,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642355325","type":"print"},{"value":"9783642355332","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35533-2_4","type":"book-chapter","created":{"date-parts":[[2012,11,22]],"date-time":"2012-11-22T16:25:30Z","timestamp":1353601530000},"page":"37-48","source":"Crossref","is-referenced-by-count":7,"title":["A Rigorous Runtime Analysis for Quasi-Random Restarts and Decreasing Stepsize"],"prefix":"10.1007","author":[{"given":"Marc","family":"Schoenauer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabien","family":"Teytaud","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Olivier","family":"Teytaud","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Augr, A., Hansen, N.: A restart CMA evolution strategy with increasing population size. In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2005, pp. 1769\u20131776 (2005)","DOI":"10.1109\/CEC.2005.1554902"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/11740698_26","volume-title":"Artificial Evolution","author":"A. Auger","year":"2006","unstructured":"Auger, A., Jebalia, M., Teytaud, O.: Algorithms (X, sigma, eta): Quasi-random Mutations for Evolution Strategies. In: Talbi, E.-G., Liardet, P., Collet, P., Lutton, E., Schoenauer, M. (eds.) EA 2005. LNCS, vol.\u00a03871, pp. 296\u2013307. Springer, Heidelberg (2006)"},{"issue":"1","key":"4_CR3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s00453-008-9244-5","volume":"57","author":"A. Auger","year":"2010","unstructured":"Auger, A., Teytaud, O.: Continuous lunches are free plus the design of optimal optimization algorithms. Algorithmica\u00a057(1), 121\u2013146 (2010)","journal-title":"Algorithmica"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Beyer, H.-G., Sendhoff, B.: Covariance Matrix Adaptation Revisited \u2013 The CMSA Evolution Strategy \u2013. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN X. LNCS, vol.\u00a05199, pp. 123\u2013132. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-87700-4_13"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Beyer, H.-G.: The Theory of Evolution Strategies. Springer, Heidelberg (2001)","DOI":"10.1007\/978-3-662-04378-3"},{"key":"4_CR6","unstructured":"DeJong, K.: The Analysis of the Behavior of a Class of Genetic Adaptive Systems. PhD thesis, University of Michigan, Ann Harbor (1975); Dissertation Abstract International 36(10), 5140B (University Microfilms No 76-9381)"},{"key":"4_CR7","unstructured":"Georgieva, A., Jordanov, I.: A hybrid meta-heuristic for global optimisation using low-discrepancy sequences of points. Computers and Operations Research - Special Issue on Hybrid Metaheuristics (in press)"},{"key":"4_CR8","unstructured":"Goldberg, D.E., Richardson, J.: Genetic algorithms with sharing for multimodalfunction optimization. In: Grefenstette, J.J. (ed.) ICGA, pp. 41\u201349. Lawrence Erlbaum Associates (1987)"},{"key":"4_CR9","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 VIII. LNCS, vol.\u00a03242, pp. 282\u2013291. Springer, Heidelberg (2004)"},{"key":"4_CR10","unstructured":"Harik, G.: Finding multiple solutions in problems of bounded difficulty. Technical Report 94002, University of Illinois at Urbana Champaign (1994)"},{"key":"4_CR11","unstructured":"Harik, G.: Finding multimodal solutions using restricted tournament selection. In: Eshelman, L.J. (ed.) Proc. Sixth International Conference on Genetic Algorithms, pp. 24\u201331. Morgan Kaufmann (1995)"},{"issue":"4","key":"4_CR12","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1023\/A:1008306431147","volume":"13","author":"D.R. Jones","year":"1998","unstructured":"Jones, D.R., Schonlau, M., Welch, W.J.: Efficient global optimization of expensive black-box functions. J. of Global Optimization\u00a013(4), 455\u2013492 (1998)","journal-title":"J. of Global Optimization"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Kimura, S., Matsumura, K.: Genetic algorithms using low-discrepancy sequences. In: GECCO, pp. 1341\u20131346 (2005)","DOI":"10.1145\/1068009.1068225"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"L\u2019Ecuyer, P., Lemieux, C.: Recent Advances in Randomized Quasi-Monte Carlo Methods, pp. 419\u2013474. Kluwer Academic (2002)","DOI":"10.1007\/0-306-48102-2_20"},{"issue":"3","key":"4_CR15","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1162\/106365602760234081","volume":"10","author":"J. Li","year":"2002","unstructured":"Li, J., Balazs, M., Parks, G., Clarkson, P.: A species conserving genetic algorithm for multimodal function optimization. Evolutionary Computation\u00a010(3), 207\u2013234 (2002)","journal-title":"Evolutionary Computation"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Lindemann, S.R., LaValle, S.M.: Incremental low-discrepancy lattice methods for motion planning. In: Proceedings IEEE International Conference on Robotics and Automation, pp. 2920\u20132927 (2003)","DOI":"10.1109\/ROBOT.2003.1242039"},{"key":"4_CR17","unstructured":"Mahfoud, S.W.: Niching methods for genetic algorithms. PhD thesis, University of Illinois at Urbana-Champaign, Champaign, IL, USA (1995)"},{"key":"4_CR18","unstructured":"Mengshoel, O.J., Goldberg, D.E.: Probabilistic crowding: Deterministic crowding with probabilisitic replacement. In: Banzhaf, W., Daida, J., Eiben, A.E., Garzon, M.H., Honavar, V., Jakiela, M., Smith, R.E. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, Orlando, Florida, USA, July 13-17, vol.\u00a01, pp. 409\u2013416. Morgan Kaufmann (1999)"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Niederreiter, H.: Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Philadelphia (1992)","DOI":"10.1137\/1.9781611970081"},{"key":"4_CR20","unstructured":"Owen, A.B.: Quasi-Monte Carlo sampling. In: Jensen, H.W. (ed.) Monte Carlo Ray Tracing: Siggraph 2003 Course 44, pp. 69\u201388. SIGGRAPH (2003)"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"P\u00e9trowski, A.: A clearing procedure as a niching method for genetic algorithms. In: International Conference on Evolutionary Computation, pp. 798\u2013803 (1996)","DOI":"10.1109\/ICEC.1996.542703"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Singh, G., Kalyanmoy Deb, D.: Comparison of multi-modal optimization algorithms based on evolutionary algorithms. In: GECCO 2006: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp. 1305\u20131312. ACM, New York (2006)","DOI":"10.1145\/1143997.1144200"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-15844-5_26","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"F. Teytaud","year":"2010","unstructured":"Teytaud, F., Teytaud, O.: Log( \u03bb ) Modifications for Optimal Parallelism. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol.\u00a06238, pp. 254\u2013263. Springer, Heidelberg (2010)"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Teytaud, O.: When Does Quasi-random Work? In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN X. LNCS, vol.\u00a05199, pp. 325\u2013336. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-87700-4_33"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Teytaud, O., Gelly, S.: DCMA: yet another derandomization in covariance-matrix-adaptation. In: Thierens, D., et al. (eds.) ACM-GECCO 2007, pp. 955\u2013963. ACM, New York (2007)","DOI":"10.1145\/1276958.1277150"},{"key":"4_CR26","unstructured":"van den Bergh, F., Engelbrecht, A.: Cooperative learning in neural networks using particle swarm optimizers (2000)"},{"issue":"2","key":"4_CR27","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/j.cam.2005.05.022","volume":"189","author":"B. Vandewoestyne","year":"2006","unstructured":"Vandewoestyne, B., Cools, R.: Good permutations for deterministic scrambled halton sequences in terms of l2-discrepancy. Computational and Applied Mathematics\u00a0189(1,2), 341\u2013361 (2006) bibitemiccama Vandewoestyne, B., Cools, R.: Good permutations for deterministic scrambled halton sequences in terms of l2-discrepancy. Computational and Applied Mathematics\u00a0189(1,2), 341\u2013361 (2006)","journal-title":"Computational and Applied Mathematics"},{"issue":"4","key":"4_CR28","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s10898-008-9354-2","volume":"44","author":"J. Villemonteix","year":"2009","unstructured":"Villemonteix, J., Vazquez, E., Walter, E.: An informational approach to the global optimization of expensive-to-evaluate functions. Journal of Global Optimization\u00a044(4), 509\u2013534 (2009)","journal-title":"Journal of Global Optimization"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Yin, X., Germay, N.: A fast genetic algorithm with sharing scheme using cluster analysis methods in multimodal function optimization. In: Albrecht, R.F., Steele, N.C., Reeves, C.R. (eds.) Artificial Neural Nets and Genetic Algorithms, pp. 450\u2013457. Springer (1993)","DOI":"10.1007\/978-3-7091-7533-0_65"}],"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-642-35533-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T14:22:24Z","timestamp":1745331744000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35533-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642355325","9783642355332"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35533-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}