{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T17:03:40Z","timestamp":1790874220646,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642198922","type":"print"},{"value":"9783642198939","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19893-9_3","type":"book-chapter","created":{"date-parts":[[2011,3,25]],"date-time":"2011-03-25T09:00:35Z","timestamp":1301043635000},"page":"31-45","source":"Crossref","is-referenced-by-count":8,"title":["Not All Parents Are Equal for MO-CMA-ES"],"prefix":"10.1007","author":[{"given":"Ilya","family":"Loshchilov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marc","family":"Schoenauer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mich\u00e8le","family":"Sebag","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Arnold, D.V., Hansen, N.: Active covariance matrix adaptation for the (1+1)-CMA-ES. In: Branke, J., et al. (eds.) ACM-GECCO, pp. 385\u2013392 (2010)","DOI":"10.1145\/1830483.1830556"},{"issue":"2-3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multi-armed bandit problem. Machine Learning\u00a047(2-3), 235\u2013256 (2002)","journal-title":"Machine Learning"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/1527125.1527138","volume-title":"FOGA","author":"A. Auger","year":"2009","unstructured":"Auger, A., Bader, J., Brockhoff, D., Zitzler, E.: Theory of the hypervolume indicator: Optimal \u03bc-distributions and the choice of the reference point. In: FOGA, pp. 87\u2013102. ACM, New York (2009)"},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1016\/j.ejor.2006.08.008","volume":"181","author":"N. Beume","year":"2007","unstructured":"Beume, N., Naujoks, B., Emmerich, M.: SMS-EMOA: Multiobjective Selection based on Dominated Hypervolume. European Journal of Operational Research\u00a0181(3), 1653\u20131669 (2007)","journal-title":"European Journal of Operational Research"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","first-page":"11","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., et al. (eds.) PPSN XI. LNCS, vol.\u00a06238, pp. 11\u201320. Springer, Heidelberg (2010)"},{"key":"3_CR6","first-page":"182","volume":"6","author":"K. Deb","year":"2000","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A Fast Elitist Multi-Objective Genetic Algorithm: NSGA-II. IEEE TEC\u00a06, 182\u2013197 (2000)","journal-title":"IEEE TEC"},{"key":"3_CR7","first-page":"1689","volume-title":"GECCO (Companion)","author":"N. Hansen","year":"2010","unstructured":"Hansen, N., Auger, A., Ros, R., Finck, S., Pos\u00edk, P.: Comparing results of 31 algorithms from the black-box optimization benchmarking BBOB-2009. In: Branke, J., et al. (eds.) GECCO (Companion), pp. 1689\u20131696. ACM, New York (2010)"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Hansen, N., M\u00fcller, S., Koumoutsakos, P.: Reducing the Time Complexity of the Derandomized Evolution Strategy with Covariance Matrix Adaptation (CMA-ES). Evolution Computation\u00a011(1) (2003)","DOI":"10.1162\/106365603321828970"},{"issue":"2","key":"3_CR9","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":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco.2007.15.1.1","volume":"15","author":"C. Igel","year":"2007","unstructured":"Igel, C., Hansen, N., Roth, S.: Covariance Matrix Adaptation for Multi-objective Optimization. Evolutionary Computation\u00a015(1), 1\u201328 (2007)","journal-title":"Evolutionary Computation"},{"key":"3_CR11","first-page":"453","volume-title":"GECCO 2006","author":"C. Igel","year":"2006","unstructured":"Igel, C., Suttorp, T., Hansen, N.: A computational efficient covariance matrix update and a (1+1)-CMA for evolution strategies. In: Keijzer, M., et al. (eds.) GECCO 2006, pp. 453\u2013460. ACM Press, New York (2006)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-540-70928-2_16","volume-title":"Evolutionary Multi-Criterion Optimization","author":"C. Igel","year":"2007","unstructured":"Igel, C., Suttorp, T., Hansen, N.: Steady-state selection and efficient covariance matrix update in the multi-objective CMA-ES. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.) EMO 2007. LNCS, vol.\u00a04403, pp. 171\u2013185. Springer, Heidelberg (2007)"},{"key":"3_CR13","unstructured":"Knowles, J., Thiele, L., Zitzler, E.: A tutorial on the performance assessment of stochastic multiobjective optimizers. Technical Report TIK 214, ETH Z\u00fcrich (2006)"},{"issue":"2","key":"3_CR14","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TEVC.2008.925798","volume":"13","author":"H. Li","year":"2009","unstructured":"Li, H., Zhang, Q.: Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA\/D and NSGA-II. IEEE Trans. Evolutionary Computation\u00a013(2), 284\u2013302 (2009)","journal-title":"IEEE Trans. Evolutionary Computation"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-540-87700-4_30","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN X","author":"R. Ros","year":"2008","unstructured":"Ros, R., Hansen, N.: A simple modification in CMA-ES achieving linear time and space complexity. In: Rudolph, G., et al. (eds.) PPSN 2008. LNCS, vol.\u00a05199, pp. 296\u2013305. Springer, Heidelberg (2008)"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1109\/TAC.1968.1098903","volume":"13","author":"M. Schumer","year":"1968","unstructured":"Schumer, M., Steiglitz, K.: Adaptive step size random search. IEEE Transactions on Automatic Control\u00a013, 270\u2013276 (1968)","journal-title":"IEEE Transactions on Automatic Control"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1162\/106365600568202","volume":"8","author":"E. Zitzler","year":"2000","unstructured":"Zitzler, E., Deb, K., Thiele, L.: Comparison of multiobjective evolutionary algorithms: Empirical results. Evolutionary Computation\u00a08, 173\u2013195 (2000)","journal-title":"Evolutionary Computation"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/BFb0056872","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"E. Zitzler","year":"1998","unstructured":"Zitzler, E., Thiele, L.: Multiobjective optimization using evolutionary algorithms - A comparative case study. In: Eiben, A.E., et al. (eds.) PPSN V 1998. LNCS, vol.\u00a01498, pp. 292\u2013301. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Multi-Criterion Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19893-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T07:55:50Z","timestamp":1558511750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19893-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198922","9783642198939"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19893-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}