{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T08:32:41Z","timestamp":1773390761877,"version":"3.50.1"},"reference-count":50,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2016,6,3]],"date-time":"2016-06-03T00:00:00Z","timestamp":1464912000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"EPSRC","doi-asserted-by":"crossref","award":["EP\/K001523\/1"],"award-info":[{"award-number":["EP\/K001523\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Royal SocietyWolfson Research Merit Award"},{"name":"ARC Discovery","award":["DP120102205"],"award-info":[{"award-number":["DP120102205"]}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61329302"],"award-info":[{"award-number":["61329302"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Math. Softw."],"published-print":{"date-parts":[[2016,6,3]]},"abstract":"<jats:p>This article proposes a competitive divide-and-conquer algorithm for solving large-scale black-box optimization problems for which there are thousands of decision variables and the algebraic models of the problems are unavailable. We focus on problems that are partially additively separable, since this type of problem can be further decomposed into a number of smaller independent subproblems. The proposed algorithm addresses two important issues in solving large-scale black-box optimization: (1) the identification of the independent subproblems without explicitly knowing the formula of the objective function and (2) the optimization of the identified black-box subproblems. First, a Global Differential Grouping (GDG) method is proposed to identify the independent subproblems. Then, a variant of the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) is adopted to solve the subproblems resulting from its rotation invariance property. GDG and CMA-ES work together under the cooperative co-evolution framework. The resultant algorithm, named CC-GDG-CMAES, is then evaluated on the CEC\u20192010 large-scale global optimization (LSGO) benchmark functions, which have a thousand decision variables and black-box objective functions. The experimental results show that, on most test functions evaluated in this study, GDG manages to obtain an ideal partition of the index set of the decision variables, and CC-GDG-CMAES outperforms the state-of-the-art results. Moreover, the competitive performance of the well-known CMA-ES is extended from low-dimensional to high-dimensional black-box problems.<\/jats:p>","DOI":"10.1145\/2791291","type":"journal-article","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T13:00:33Z","timestamp":1465563633000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":213,"title":["A Competitive Divide-and-Conquer Algorithm for Unconstrained Large-Scale Black-Box Optimization"],"prefix":"10.1145","volume":"42","author":[{"given":"Yi","family":"Mei","sequence":"first","affiliation":[{"name":"RMIT University, VIC, Australia"}]},{"given":"Mohammad Nabi","family":"Omidvar","sequence":"additional","affiliation":[{"name":"RMIT University, VIC, Australia"}]},{"given":"Xiaodong","family":"Li","sequence":"additional","affiliation":[{"name":"RMIT University, VIC, Australia"}]},{"given":"Xin","family":"Yao","sequence":"additional","affiliation":[{"name":"University of Birmingham, Birmingham, UK"}]}],"member":"320","published-online":{"date-parts":[[2016,6,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0266466600005478"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/502800.502804"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/3182687.3183125"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2559127.2559132"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/17.946528"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"W. Chen T. Weise Z. Yang and K. Tang. 2010. Large-scale global optimization using cooperative coevolution with variable interaction learning. Parallel Problem Solving from Nature (PPSN XI\u201910) 300--309.   W. Chen T. Weise Z. Yang and K. Tang. 2010. Large-scale global optimization using cooperative coevolution with variable interaction learning. Parallel Problem Solving from Nature (PPSN XI\u201910) 300--309.","DOI":"10.1007\/978-3-642-15871-1_31"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1328794.1328802"},{"key":"e_1_2_1_8_1","unstructured":"G. B. Dantzig and M. N. Thapa. 1997. Linear Programming: 1: Introduction. Vol. 1. Springer.   G. B. Dantzig and M. N. Thapa. 1997. Linear Programming: 1: Introduction. Vol. 1. Springer."},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 6th International Symposium on Micro Machine and Human Science (MHS\u201995)","author":"Eberhart R."},{"key":"e_1_2_1_10_1","unstructured":"J. Friedenberg and G. Silverman. 2006. Mind as a black box: The behaviorist approach. In Cognitive Science: An Introduction to the Study of Mind. Sage Thousand Oaks CA 85--88.  J. Friedenberg and G. Silverman. 2006. Mind as a black box: The behaviorist approach. In Cognitive Science: An Introduction to the Study of Mind. Sage Thousand Oaks CA 85--88."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1080\/00401706.1989.10488470"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132973.1132979"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830761.1830790"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of 1996 IEEE International Conference on Evolutionary Computation. IEEE, 312--317","author":"Hansen N."},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","volume-title":"Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence","author":"Holland J. H.","DOI":"10.7551\/mitpress\/1090.001.0001"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/321062.321069"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/362248.362272"},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"P. Larra\u00f1aga and J.A. Lozano. 2002. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Vol. 2. Springer.  P. Larra\u00f1aga and J.A. Lozano. 2002. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Vol. 2. Springer.","DOI":"10.1007\/978-1-4615-1539-5"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1021\/jp010450t"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2011.2112662"},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the 2001 Congress on Evolutionary Computation","volume":"2","author":"Liu Y."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001697"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281503"},{"key":"e_1_2_1_26_1","volume-title":"IEEE Congress on Evolutionary Computation (CEC\u201910)","author":"Molina D."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/7.4.308"},{"key":"e_1_2_1_28_1","doi-asserted-by":"crossref","unstructured":"M. N. Omidvar and X. Li. 2010. A comparative study of CMA-ES on large scale global optimisation. In AI 2010: Advances in Artificial Intelligence. Springer 303--312.  M. N. Omidvar and X. Li. 2010. A comparative study of CMA-ES on large scale global optimisation. In AI 2010: Advances in Artificial Intelligence. Springer 303--312.","DOI":"10.1007\/978-3-642-17432-2_31"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281543"},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of the 2010 IEEE Congress on Evolutionary Computation. 1--8.","author":"Omidvar M. N."},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the 2010 IEEE Congress on Evolutionary Computation (CEC\u201910)","author":"Omidvar M. N."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001727"},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the 2014 IEEE Congress on Evolutionary Computation (CEC\u201914)","author":"Omidvar M. N."},{"key":"e_1_2_1_34_1","doi-asserted-by":"crossref","unstructured":"M. A. Potter and K. De Jong. 1994. A cooperative coevolutionary approach to function optimization. Parallel Problem Solving from Nature (PPSN) 249--257.   M. A. Potter and K. De Jong. 1994. A cooperative coevolutionary approach to function optimization. Parallel Problem Solving from Nature (PPSN) 249--257.","DOI":"10.1007\/3-540-58484-6_269"},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","unstructured":"P. Richt\u00e1rik and M. Tak\u00e1\u010d. 2012. Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Mathematical Programming 1--38.  P. Richt\u00e1rik and M. Tak\u00e1\u010d. 2012. Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Mathematical Programming 1--38.","DOI":"10.1007\/s10107-012-0614-z"},{"key":"e_1_2_1_36_1","article-title":"Derivative-free optimization: A review of algorithms and comparison of software implementations","author":"Rios L. M.","year":"2012","journal-title":"Journal of Global Optimization 1--47."},{"key":"e_1_2_1_37_1","doi-asserted-by":"crossref","unstructured":"R. Ros and N. Hansen. 2008. A simple modification in CMA-ES achieving linear time and space complexity. In Parallel Problem Solving from Nature--PPSN X. Springer 296--305.  R. Ros and N. Hansen. 2008. A simple modification in CMA-ES achieving linear time and space complexity. In Parallel Problem Solving from Nature--PPSN X. Springer 296--305.","DOI":"10.1007\/978-3-540-87700-4_30"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/3.3.175"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-009-0420-2"},{"key":"e_1_2_1_40_1","volume-title":"Handbook of Parametric and Nonparametric Statistical Procedures","author":"Sheskin D. J."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/11539117_147"},{"key":"e_1_2_1_42_1","doi-asserted-by":"crossref","unstructured":"J. Smith and T. C. Fogarty. 1995. An adaptive poly-parental recombination strategy. In Evolutionary Computing. Springer 48--61.   J. Smith and T. C. Fogarty. 1995. An adaptive poly-parental recombination strategy. In Evolutionary Computing. Springer 48--61.","DOI":"10.1007\/3-540-60469-3_24"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176349548"},{"key":"e_1_2_1_44_1","unstructured":"K. Tang X. Li P. N. Suganthan Z. Yang and T. Weise. 2009. Benchmark Functions for the CEC\u201910 Special Session and Competition on Large-Scale Global Optimization. Technical Report. Nature Inspired Computation and Applications Laboratory USTC China. Retrieved April 7 2016 from http:\/\/nical.ustc.edu.cn\/cec10ss.php.  K. Tang X. Li P. N. Suganthan Z. Yang and T. Weise. 2009. Benchmark Functions for the CEC\u201910 Special Session and Competition on Large-Scale Global Optimization. Technical Report. Nature Inspired Computation and Applications Laboratory USTC China. Retrieved April 7 2016 from http:\/\/nical.ustc.edu.cn\/cec10ss.php."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1017501703105"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.826069"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355755"},{"key":"e_1_2_1_48_1","volume-title":"Proceedings of the 1999 IEEE Congress on Evolutionary Computation. IEEE.","author":"Weicker K."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.2307\/3001968"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2008.02.017"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.771163"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/279232.279236"}],"container-title":["ACM Transactions on Mathematical Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2791291","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2791291","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:28Z","timestamp":1750227388000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2791291"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,3]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6,3]]}},"alternative-id":["10.1145\/2791291"],"URL":"https:\/\/doi.org\/10.1145\/2791291","relation":{},"ISSN":["0098-3500","1557-7295"],"issn-type":[{"value":"0098-3500","type":"print"},{"value":"1557-7295","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,3]]},"assertion":[{"value":"2014-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-06-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}