{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T15:58:32Z","timestamp":1762444712197,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T00:00:00Z","timestamp":1498780800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61473165","61134012"],"award-info":[{"award-number":["61473165","61134012"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61603248"],"award-info":[{"award-number":["61603248"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s10898-017-0541-x","type":"journal-article","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T04:27:01Z","timestamp":1498796821000},"page":"797-822","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Adaptive block coordinate DIRECT algorithm"],"prefix":"10.1007","volume":"69","author":[{"given":"Qinghua","family":"Tao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaolin","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuning","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,30]]},"reference":[{"issue":"2","key":"541_CR1","first-page":"1","volume":"1","author":"M Bj\u00f6rkman","year":"2002","unstructured":"Bj\u00f6rkman, M., Holmstrom, K.: Global optimization using the DIRECT algorithm in Matlab. Matlab Adv. Model. Optim. 1(2), 1\u20138 (2002)","journal-title":"Matlab Adv. Model. Optim."},{"issue":"3\u20134","key":"541_CR2","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1561\/2200000050","volume":"8","author":"S Bubeck","year":"2015","unstructured":"Bubeck, S.: Convex optimization: algorithms and complexity. Found. Trends Mach. Learn. 8(3\u20134), 231\u2013357 (2015)","journal-title":"Found. Trends Mach. Learn."},{"issue":"3","key":"541_CR3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1080\/10618560290034663","volume":"16","author":"J Burkardt","year":"2002","unstructured":"Burkardt, J., Gunzburger, M., Peterson, J.: Insensitive functionals, inconsistent gradients, spurious minima, and regularized functionals in flow optimization problems. Int. J. Comput. Fluid Dyn. 16(3), 171\u2013185 (2002)","journal-title":"Int. J. Comput. Fluid Dyn."},{"issue":"2","key":"541_CR4","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1023\/A:1013123110266","volume":"2","author":"RG Carter","year":"2001","unstructured":"Carter, R.G., Gablonsky, J.M., Patrick, A., Kelley, C.T., Eslinger, O.J.: Algorithms for noisy problems in gas transmission pipeline optimization. Optim. Eng. 2(2), 139\u2013157 (2001)","journal-title":"Optim. Eng."},{"key":"541_CR5","volume-title":"Parallel Optimization: Theory, Algorithms, and Applications","author":"Y Censor","year":"1997","unstructured":"Censor, Y., Zenios, S.A.: Parallel Optimization: Theory, Algorithms, and Applications. Oxford University Press, Oxford (1997)"},{"issue":"4","key":"541_CR6","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s10898-006-9029-9","volume":"36","author":"DE Finkel","year":"2006","unstructured":"Finkel, D.E., Kelley, C.T.: Additive scaling and the DIRECT algorithm. J. Global Optim. 36(4), 597\u2013608 (2006)","journal-title":"J. Global Optim."},{"key":"541_CR7","unstructured":"Finkel, D.E.: Global optimization with the DIRECT algorithm. Ph.D. thesis, North Carolina State University, Raleigh, North Carolina (2005)"},{"key":"541_CR8","unstructured":"Finkel, D.E.: DIRECT optimization algorithm user guide. Center for Research in Scientific Computation (2003)"},{"key":"541_CR9","unstructured":"Gablonsky, J.M.: Modifications of the DIRECT algorithm. Ph.D. thesis, North Carolina State University, Raleigh, North Carolina (2001)"},{"key":"541_CR10","doi-asserted-by":"crossref","unstructured":"Grbi\u0107, R., Nyarko, E.K., Scitovski, R.: A modification of the DIRECT method for Lipschitz global optimization for a symmetric function. J. Global Optim. 57(4), 1193\u20131212 (2013)","DOI":"10.1007\/s10898-012-0020-3"},{"issue":"1","key":"541_CR11","first-page":"1","volume":"40","author":"SP Han","year":"1987","unstructured":"Han, S.P.: A succesive projection method. Math. Program. 40(1), 1\u201314 (1987)","journal-title":"Math. Program."},{"issue":"1","key":"541_CR12","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/nav.3800040113","volume":"4","author":"C Hildreth","year":"1957","unstructured":"Hildreth, C.: A quadratic programming procedure. Nav. Res. Logist. Q. 4(1), 79\u201385 (1957)","journal-title":"Nav. Res. Logist. Q."},{"issue":"1","key":"541_CR13","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/BF01580431","volume":"8","author":"HR Howson","year":"1975","unstructured":"Howson, H.R., Sancho, N.G.F.: A new algorithm for the solution of multistate dynamic programming problems. Math. Program. 8(1), 104\u2013116 (1975)","journal-title":"Math. Program."},{"issue":"4","key":"541_CR14","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1023\/A:1008382309369","volume":"14","author":"W Huyer","year":"1999","unstructured":"Huyer, W., Neumaier, A.: Global optimization by multilevel coordinate search. J. Global Optim. 14(4), 331\u2013355 (1999)","journal-title":"J. Global Optim."},{"issue":"1","key":"541_CR15","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00941892","volume":"79","author":"DR Jones","year":"1993","unstructured":"Jones, D.R., Perttunen, C.D., Stuckman, B.E.: Lipschitzian optimization without the Lipschitz constant. J. Optim. Theory Appl. 79(1), 157\u2013181 (1993)","journal-title":"J. Optim. Theory Appl."},{"key":"541_CR16","first-page":"431","volume-title":"DIRECT Global Optimization Algorithm","author":"DR Jones","year":"2001","unstructured":"Jones, D.R.: DIRECT Global Optimization Algorithm, pp. 431\u2013440. Springer, New York (2001)"},{"key":"541_CR17","unstructured":"Kearsley, A.J.: The use of optimization techniques in the solution of partial differential equations from science and engineering. Ph.D. thesis, Department of Computational and Applied Mathematics, Rice University, Houston, TX (1996)"},{"issue":"3","key":"541_CR18","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1162\/evco.2009.17.3.437","volume":"17","author":"S Kok","year":"2009","unstructured":"Kok, S., Sandrock, C.: Locating and characterizing the stationary points of the extended Rosenbrock function. Evol. Comput. 17(3), 437\u2013453 (2009)","journal-title":"Evol. Comput."},{"issue":"3","key":"541_CR19","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s10898-013-0119-1","volume":"60","author":"Q Liu","year":"2014","unstructured":"Liu, Q., Cheng, W.: A modified DIRECT algorithm with bilevel partition. J. Global Optim. 60(3), 483\u2013499 (2014)","journal-title":"J. Global Optim."},{"issue":"1","key":"541_CR20","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10898-014-0152-8","volume":"61","author":"Q Liu","year":"2015","unstructured":"Liu, Q., Zeng, J.: Global optimization by multilevel partition. J. Global Optim. 61(1), 47\u201369 (2015)","journal-title":"J. Global Optim."},{"issue":"C","key":"541_CR21","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/j.sigpro.2014.10.010","volume":"108","author":"L Li","year":"2015","unstructured":"Li, L., Huang, X., Suykens, J.A.K.: Signal recovery for jointly sparse vectors with different sensing matrices. Signal Process. 108(C), 451\u2013458 (2015)","journal-title":"Signal Process."},{"key":"541_CR22","unstructured":"Munos, R.: Optimistic optimization of a deterministic function without the knowledge of its smoothness. In: NIPS, pp. 783\u2013791 (2011)"},{"key":"541_CR23","unstructured":"Pardalos, P.M., Schoen, F.: Recent advances and trends in global optimization: deterministic and stochastic methods. In: Proceedings of the Sixth International Conference on Foundations of Computer-Aided Process Design, pp. 119\u2013131 (2004)"},{"issue":"3","key":"541_CR24","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1007\/s00158-013-0919-4","volume":"48","author":"V Picheny","year":"2013","unstructured":"Picheny, V., Wagner, T., Ginsbourger, D.: A benchmark of kriging-based infill criteria for noisy optimization. Struct. Multidiscip. Optim. 48(3), 607\u2013626 (2013)","journal-title":"Struct. Multidiscip. Optim."},{"key":"541_CR25","doi-asserted-by":"crossref","unstructured":"Preux, P., Munos, R., Valko, M.: Bandits attack function optimization. In: Proceedings of IEEE Congress on Evolutionary Computation, pp. 2245\u20132252 (2014)","DOI":"10.1109\/CEC.2014.6900558"},{"issue":"1","key":"541_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-012-0614-z","volume":"44","author":"P Richt\u00e1rik","year":"2014","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M.: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Math. Program. 44(1), 1\u201338 (2014)","journal-title":"Math. Program."},{"issue":"10","key":"541_CR27","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1109\/TCOM.1977.1093750","volume":"25","author":"TA Stern","year":"1977","unstructured":"Stern, T.A.: Class of decentralized routing algorithms using relaxation. IEEE Trans. Commun. 25(10), 1092\u20131102 (1977)","journal-title":"IEEE Trans. Commun."},{"issue":"3","key":"541_CR28","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1137\/0709036","volume":"9","author":"BO Shubert","year":"1972","unstructured":"Shubert, B.O.: A sequential method seeking the global maximum of a function. SIAM J. Numer. Anal. 9(3), 379\u2013388 (1972)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"541_CR29","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0328011","volume":"28","author":"P Tseng","year":"1988","unstructured":"Tseng, P.: Dual ascent methods for problems with strictly convex costs and linear constraints: a unified approach. SIAM J. Control Optim. 28(1), 214\u2013242 (1988)","journal-title":"SIAM J. Control Optim."},{"key":"541_CR30","unstructured":"Valko, M., Carpentier, A., Munos, R.: Stochastic simultaneous optimistic optimization. In: International Conference on Machine Learning, pp. 19\u201327 (2013)"},{"issue":"1","key":"541_CR31","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","volume":"151","author":"SJ Wright","year":"2015","unstructured":"Wright, S.J.: Coordinate descent algorithms. Math. Program. 151(1), 3\u201334 (2015)","journal-title":"Math. Program."},{"issue":"5","key":"541_CR32","doi-asserted-by":"crossref","first-page":"2168","DOI":"10.1109\/TMAG.2002.802794","volume":"38","author":"H Zhu","year":"2002","unstructured":"Zhu, H., Bogy, D.B.: DIRECT algorithm and its application to slider air-bearing surface optimization. IEEE Trans. Magn. 38(5), 2168\u20132170 (2002)","journal-title":"IEEE Trans. Magn."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-017-0541-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0541-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0541-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,13]],"date-time":"2017-11-13T02:07:53Z","timestamp":1510538873000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-017-0541-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,30]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["541"],"URL":"https:\/\/doi.org\/10.1007\/s10898-017-0541-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2017,6,30]]}}}