{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:54Z","timestamp":1760202534473,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540389903"},{"type":"electronic","value":"9783540389910"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11844297_4","type":"book-chapter","created":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T18:55:37Z","timestamp":1160074537000},"page":"32-41","source":"Crossref","is-referenced-by-count":10,"title":["On the Ultimate Convergence Rates for Isotropic Algorithms and the Best Choices Among Various Forms of Isotropy"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Teytaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Gelly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00e9mie","family":"Mary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Auger, A.: Convergence results for (1,\u03bb)-SA-ES using the theory of \u03d5-irreducible markov chains. Theoretical Computer Science (in press, 2005)"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Auger, A., Jebalia, M., Teytaud, O.: Xse: quasi-random mutations for evolution strategies. In: Proceedings of Evolutionary Algorithms, pages 12 (2005)","DOI":"10.1007\/11740698_26"},{"key":"4_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04378-3","volume-title":"The Theory of Evolutions Strategies","author":"H.-G. Beyer","year":"2001","unstructured":"Beyer, H.-G.: The Theory of Evolutions Strategies. Springer, Heidelberg (2001)"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1093\/imamat\/6.3.222","volume":"6","author":"C.G. Broyden","year":"1970","unstructured":"Broyden, C.G.: The convergence of a class of double-rank minimization algorithms 2, the new algorithm. j. of the inst. for math. and applications\u00a06, 222\u2013231 (1970)","journal-title":"j. of the inst. for math. and applications"},{"key":"4_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626371","volume-title":"The discrepancy method: randomness and complexity","author":"B. Chazelle","year":"2000","unstructured":"Chazelle, B.: The discrepancy method: randomness and complexity. Cambridge University Press, New York (2000)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Conway, J.H., Sloane, N.J.: Sphere packings, lattices and groups (1998)","DOI":"10.1007\/978-1-4757-6568-7"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1093\/comjnl\/13.3.317","volume":"13","author":"R. Fletcher","year":"1970","unstructured":"Fletcher, R.: A new approach to variable-metric algorithms. computer journal\u00a013, 317\u2013322 (1970)","journal-title":"computer journal"},{"key":"4_CR8","unstructured":"Frahm, G., Junker, M.: Generalized elliptical distributions: Models and estimation. Technical Report 0037 (2003)"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1090\/S0025-5718-1970-0258249-6","volume":"24","author":"D. Goldfarb","year":"1970","unstructured":"Goldfarb, D.: A family of variable-metric algorithms derived by variational means. mathematics of computation\u00a024, 23\u201326 (1970)","journal-title":"mathematics of computation"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"231","DOI":"10.4064\/sm-70-3-231-283","volume":"70","author":"U. Haagerup","year":"1982","unstructured":"Haagerup, U.: The best constants in the khintchine inequality. Studia Math.\u00a070, 231\u2013283 (1982)","journal-title":"Studia Math."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation\u00a011(1) (2003)","DOI":"10.1162\/106365603321828970"},{"key":"4_CR12","unstructured":"Jagerskupper, J.: In between progress rate and stochastic convergence. Dagstuhl\u2019s seminar (2006)"},{"key":"4_CR13","unstructured":"Literka: A remarkable monotonic property of the gamma function. Technical report (2005)"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/BFb0040786","volume-title":"Evolutionary Programming VII","author":"R. Salomon","year":"1998","unstructured":"Salomon, R.: Resampling and its avoidance in genetic algorithms. In: Porto, V.W., Saravanan, N., Waagen, D., Eiben, A.E. (eds.) Evolutionary Programming VII, pp. 335\u2013344. Springer, Berlin (1998)"},{"key":"4_CR15","unstructured":"Salomon, R.: The deterministic genetic algorithm: Implementation details and some results (1999)"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1090\/S0025-5718-1970-0274029-X","volume":"24","author":"D.F. Shanno","year":"1970","unstructured":"Shanno, D.F.: Conditioning of quasi-newton methods for function minimization. mathematics of computation\u00a024, 647\u2013656 (1970)","journal-title":"mathematics of computation"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Teytaud, O., Gelly, S.: General lower bounds for evolutionary algorithms, ppsn (2006)","DOI":"10.1007\/11844297_3"},{"issue":"10","key":"4_CR18","doi-asserted-by":"publisher","first-page":"2460","DOI":"10.1175\/1520-0493(1997)125<2460:AOANAN>2.0.CO;2","volume":"125","author":"Z. Wang","year":"1997","unstructured":"Wang, Z., Droegemeier, K., White, L., Navon, I.M.: Application of a new adjoint newton algorithm to the 3-d arps storm scale model using simulated data. Monthly Weather Review\u00a0125(10), 2460\u20132478 (1997)","journal-title":"Monthly Weather Review"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Witt, C., J\u00e4gersk\u00fcpper, J.: Rigorous runtime analysis of a (mu+1) es for the sphere function. In: Proceedings of the 2005 Conference on Genetic and Evolutionary Computation, pp. 849\u2013856 (2005)","DOI":"10.1145\/1068009.1068153"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature - PPSN IX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/11844297_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T01:04:22Z","timestamp":1664240662000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/11844297_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540389903","9783540389910"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11844297_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}