{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:51Z","timestamp":1740145191766,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T00:00:00Z","timestamp":1628640000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T00:00:00Z","timestamp":1628640000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1562466"],"award-info":[{"award-number":["CMMI-1562466"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s11590-021-01792-3","type":"journal-article","created":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T16:02:49Z","timestamp":1628697769000},"page":"1137-1151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Convergence rate of a rectangular subdivision-based optimization algorithm for smooth multivariate functions"],"prefix":"10.1007","volume":"16","author":[{"given":"Cuicui","family":"Zheng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5304-3336","authenticated-orcid":false,"given":"James","family":"Calvin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,11]]},"reference":[{"key":"1792_CR1","doi-asserted-by":"crossref","unstructured":"Calvin, J.M., Gimbutien\u0117, G., Phillips, W.O., Z\u0306ilinskas, A.: On convergence rate of a rectangular partition based global optimization algorithm. J. Glob. Optim. 71, 165\u2013191 (2018)","DOI":"10.1007\/s10898-018-0636-z"},{"key":"1792_CR2","unstructured":"Finkel, D. E.: Global optimization with the DIRECT algorithm. PhD thesis, North Carolina State University, Raleigh, North Carolina, (2005)"},{"key":"1792_CR3","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1145\/962437.962444","volume":"29","author":"M Gaviano","year":"2003","unstructured":"Gaviano, M., Kvasov, D.E., Lera, D., Sergeyev, Ya.. D.: Algorithm 829: software for generation of classes of test functions with known local and global minima for global optimization. ACM Trans. Math. Softw. 29, 469\u2013480 (2003)","journal-title":"ACM Trans. Math. Softw."},{"key":"1792_CR4","doi-asserted-by":"publisher","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, 157\u2013181 (1993)","journal-title":"J. Optim. Theory Appl."},{"key":"1792_CR5","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.amc.2017.05.014","volume":"318","author":"DE Kvasov","year":"2018","unstructured":"Kvasov, D.E., Mukhametzhanov, M.S.: Metaheuristic vs. deterministic global optimization algorithms: the univariate case. Appl. Math. Comput. 318, 245\u2013259 (2018)","journal-title":"Appl. Math. Comput."},{"issue":"16","key":"1792_CR6","doi-asserted-by":"publisher","first-page":"4042","DOI":"10.1016\/j.cam.2012.02.020","volume":"236","author":"DE Kvasov","year":"2012","unstructured":"Kvasov, D.E., Sergeyev, Ya.. D.: Lipschitz gradients for global optimization in a one-point-based partitioning scheme. J. Comput. Appl. Math. 236(16), 4042\u20134054 (2012)","journal-title":"J. Comput. Appl. Math."},{"key":"1792_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.3934\/naco.2012.2.69","volume":"2","author":"DE Kvasov","year":"2012","unstructured":"Kvasov, D.E., Sergeyev, Ya.. D.: Univariate geometric Lipschitz global optimization algorithms. Num. Algebra Control Optim. 2, 69\u201390 (2012)","journal-title":"Num. Algebra Control Optim."},{"key":"1792_CR8","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s11590-008-0110-9","volume":"3","author":"DE Kvasov","year":"2009","unstructured":"Kvasov, D.E., Sergeyev, Ya..D..: A univariate global search working with a set of Lipschitz constants for the first derivative. Optim. Lett. 3, 303\u2013318 (2009)","journal-title":"Optim. Lett."},{"issue":"1","key":"1792_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000038","volume":"7","author":"R Munos","year":"2014","unstructured":"Munos, R.: From bandits to Monte-Carlo tree search: the optimistic principle applied to optimization and planning. Found. Trends Mach. Learn. 7(1), 1\u2013129 (2014)","journal-title":"Found. Trends Mach. Learn."},{"key":"1792_CR10","unstructured":"Zheng, C.: Global optimization algorithms for image registration and clustering. PhD Thesis, New Jersey Institute of Technology, Newark, New Jersey, (2020)"},{"key":"1792_CR11","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s10898-020-00914-y","volume":"79","author":"C Zheng","year":"2021","unstructured":"Zheng, C., Calvin, J., Gotsman, C.: A direct-type global optimization algorithm for image registration. J. Glob. Optim. 79, 431\u2013445 (2021)","journal-title":"J. Glob. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01792-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01792-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01792-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T07:00:08Z","timestamp":1699340408000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01792-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,11]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["1792"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01792-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2021,8,11]]},"assertion":[{"value":"10 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}