{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T20:48:30Z","timestamp":1760820510716},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,12,23]],"date-time":"2012-12-23T00:00:00Z","timestamp":1356220800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s10898-012-0020-3","type":"journal-article","created":{"date-parts":[[2012,12,22]],"date-time":"2012-12-22T08:28:18Z","timestamp":1356164898000},"page":"1193-1212","source":"Crossref","is-referenced-by-count":37,"title":["A modification of the DIRECT method for Lipschitz global optimization for a symmetric function"],"prefix":"10.1007","volume":"57","author":[{"given":"Ratko","family":"Grbi\u0107","sequence":"first","affiliation":[]},{"given":"Emmanuel Karlo","family":"Nyarko","sequence":"additional","affiliation":[]},{"given":"Rudolf","family":"Scitovski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,12,23]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/j.cam.2006.01.028","volume":"200","author":"I Alolyan","year":"2007","unstructured":"Alolyan, I.: A new exclusion test for finding the global minimum. J. Comput. Appl. Math. 200, 491\u2013502 (2007)","journal-title":"J. Comput. Appl. Math."},{"key":"20_CR2","doi-asserted-by":"crossref","DOI":"10.1142\/7438","volume-title":"Theory of Randomized Search Heuristics, Vol. 1 of Theoretical Computer Science","author":"A Auger","year":"2011","unstructured":"Auger, A., Doerr, B.: Theory of Randomized Search Heuristics, Vol. 1 of Theoretical Computer Science. World Scientific, Danvers (2011)"},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1016\/j.amc.2005.11.127","volume":"179","author":"L Chiter","year":"2006","unstructured":"Chiter, L.: Direct algorithm: a new definition of potentially optimal hyperrectangles. Appl. Math. Comput. 179, 742\u2013749 (2006)","journal-title":"Appl. Math. Comput."},{"key":"20_CR4","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/j.amc.2005.07.051","volume":"175","author":"L Chiter","year":"2006","unstructured":"Chiter, L.: A new sampling method in the direct algorithm. Appl. Math. Comput. 175, 297\u2013306 (2006)","journal-title":"Appl. Math. Comput."},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10957-011-9856-9","volume":"151","author":"D Serafino di","year":"2011","unstructured":"di Serafino, D., Liuzzi, G., Piccialli, V., Riccio, F., Toraldo, G.: A modified dividing rectangles algorithm for a problem in astrophysics. J. Optim. Theory Appl. 151, 175\u2013190 (2011)","journal-title":"J. Optim. Theory Appl."},{"key":"20_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5022-7","volume-title":"Numerical Optimization Techniques (Translations Series in Mathematics and Engineering)","author":"YG Evtushenko","year":"1985","unstructured":"Evtushenko, Y.G.: Numerical Optimization Techniques (Translations Series in Mathematics and Engineering). Springer, Berlin (1985)"},{"key":"20_CR7","unstructured":"Finkel, D.E.: DIRECT Optimization Algorithm User Guide, Center for Research in Scientific Computation. North Carolina State University, 2003, http:\/\/www4.ncsu.edu\/definkel\/research\/index.html"},{"key":"20_CR8","unstructured":"Finkel, D.E., Kelley, C.T.: Convergence analysis of the direct algorithm crsc-tr04-28. Center for Research in Scientific Computation, North Carolina State University, Technical Report (2004)"},{"key":"20_CR9","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. Glob. Optim. 36, 597\u2013608 (2006)","journal-title":"J. Glob. Optim."},{"key":"20_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10898-008-9332-8","volume":"45","author":"CA Floudas","year":"2009","unstructured":"Floudas, C.A., Gounaris, C.E.: A review of recent advances in global optimization. J. Glob. Optim. 45, 3\u201338 (2009)","journal-title":"J. Glob. Optim."},{"key":"20_CR11","unstructured":"Gablonsky, J. M.: Direct version 2.0, Technical report, Center for Research in Scientific Computation. North Carolina State University (2001)"},{"key":"20_CR12","unstructured":"Gablonsky, J.M.: Modifications of the DIRECT Algorithm, Ph.D. thesis, North Carolina State University (2001)"},{"key":"20_CR13","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1023\/A:1017930332101","volume":"21","author":"JM Gablonsky","year":"2001","unstructured":"Gablonsky, J.M., Kelley, C.T.: A locally-biased form of the direct algorithm. J. Glob. Optim. 21, 27\u201337 (2001)","journal-title":"J. Glob. Optim."},{"key":"20_CR14","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718348","volume-title":"Data Clustering: Theory, Algorithms, and Applications","author":"G Gan","year":"2007","unstructured":"Gan, G., Ma, C., Wu, J.: Data Clustering: Theory, Algorithms, and Applications. SIAM, Philadelphia (2007)"},{"key":"20_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11590-006-0036-z","volume":"2","author":"M Gaviano","year":"2008","unstructured":"Gaviano, M., Lera, D.: A global minimization algorithm for Lipschitz functions. Optim. Lett. 2, 1\u201313 (2008)","journal-title":"Optim. Lett."},{"key":"20_CR16","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1080\/10556780903039893","volume":"25","author":"JD Griffin","year":"2010","unstructured":"Griffin, J.D., Kolda, T.G.: Asynchronous parallel hybrid optimization combining DIRECT and GSS. Optim. Methods Softw. 25, 797\u2013817 (2010)","journal-title":"Optim. Methods Softw."},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Hansen, E., Walster, G.W.: Global Optimization using Interval Analysis, 2nd edn. Marcel Dekker, New York (2004)","DOI":"10.1201\/9780203026922"},{"key":"20_CR18","volume-title":"Handbook of Global Optimization","year":"1995","unstructured":"Horst, R., Pardalos, P.M. (eds.): Handbook of Global Optimization, vol. 1. Kluwer Academic Publishers, Dordrecht (1995)"},{"key":"20_CR19","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. Glob. Optim. 14, 331\u2013355 (1999)","journal-title":"J. Glob. Optim."},{"key":"20_CR20","unstructured":"Iyigun, C.: Probabilistic distance clustering, Ph.D. thesis, Graduate School\u2014New Brunswick, Rutgers (2007)"},{"key":"20_CR21","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.orl.2009.11.005","volume":"38","author":"C Iyigun","year":"2010","unstructured":"Iyigun, C., Ben-Israel, A.: A generalized weiszfeld method for the multi-facility location problem. Oper. Res. Lett. 38, 207\u2013214 (2010)","journal-title":"Oper. Res. Lett."},{"key":"20_CR22","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1023\/A:1012771025575","volume":"21","author":"DR Jones","year":"2001","unstructured":"Jones, D.R.: A taxonomy of global optimization methods based on response surfaces. J. Glob. Optim. 21, 345\u2013383 (2001)","journal-title":"J. Glob. Optim."},{"key":"20_CR23","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, 157\u2013181 (1993)","journal-title":"J. Optim. Theory Appl."},{"key":"20_CR24","volume-title":"Introduction to Clustering Large and High-Dimensional Data","author":"J Kogan","year":"2007","unstructured":"Kogan, J.: Introduction to Clustering Large and High-Dimensional Data. Cambridge University Press, Cambridge (2007)"},{"key":"20_CR25","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1137\/S003614450242889","volume":"45","author":"TG Kolda","year":"2003","unstructured":"Kolda, T.G., Lewis, R.M., Torczon, V.: Optimization by direct search: New perspectives on some classical and modern methods. SIAM Rev. 45, 385\u2013482 (2003)","journal-title":"SIAM Rev."},{"key":"20_CR26","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s11590-008-0110-9","volume":"3","author":"DE Kvasov","year":"2009","unstructured":"Kvasov, D.E., Sergeyev, Y.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."},{"key":"20_CR27","doi-asserted-by":"crossref","first-page":"69","DOI":"10.3934\/naco.2012.2.69","volume":"2","author":"DE Kvasov","year":"2012","unstructured":"Kvasov, D.E., Sergeyev, Y.D.: Univariate geometric Lipschitz global optimisation algorithms. Numer. Algebra Control Optim. 2, 69\u201390 (2012)","journal-title":"Numer. Algebra Control Optim."},{"key":"20_CR28","doi-asserted-by":"crossref","first-page":"4042","DOI":"10.1016\/j.cam.2012.02.020","volume":"236","author":"DE Kvasov","year":"2012","unstructured":"Kvasov, D.E., Sergeyev, Y.D.: Lipschitz gradients for global optimization in a one-point-based partitioning scheme. J. Comput. Appl. Math. 236, 4042\u20134054 (2012)","journal-title":"J. Comput. Appl. Math."},{"key":"20_CR29","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1016\/j.csda.2005.10.006","volume":"51","author":"F Leisch","year":"2006","unstructured":"Leisch, F.: A toolbox for k-centroids cluster analysis. Comput. Stat. Data Anal. 51, 526\u2013544 (2006)","journal-title":"Comput. Stat. Data Anal."},{"key":"20_CR30","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s10589-008-9217-2","volume":"45","author":"G Liuzzi","year":"2010","unstructured":"Liuzzi, G., Lucidi, S., Piccialli, V.: A direct-based approach for large-scale global optimization problems. Comput. Optim. Appl. 45, 353\u2013375 (2010)","journal-title":"Comput. Optim. Appl."},{"key":"20_CR31","first-page":"524","volume":"22","author":"J Mockus","year":"2011","unstructured":"Mockus, J.: On the pareto optimality in the context of lipschitzian optimization. Informatica 22, 524\u2013536 (2011)","journal-title":"Informatica"},{"key":"20_CR32","unstructured":"Neumaier, A.: Complete search in continuous global optimization and constraint satisfaction, Acta Numerica 13, 271\u2013369 (2004)"},{"key":"20_CR33","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/S0096-3003(03)00661-1","volume":"153","author":"EK Nyarko","year":"2004","unstructured":"Nyarko, E.K., Scitovski, R.: Solving the parameter identification problem of mathematical model using genetic algorithms. Appl. Math. Comput. 153, 651\u2013658 (2004)","journal-title":"Appl. Math. Comput."},{"key":"20_CR34","doi-asserted-by":"crossref","unstructured":"Pardalos, P.M., Coleman, T.F. (eds.): Lectures on global optimization, Fields Institute Communications Series, vol. 55. AMS (2009)","DOI":"10.1090\/fic\/055"},{"key":"20_CR35","first-page":"888","volume":"12","author":"SA Pijavskij","year":"1972","unstructured":"Pijavskij, S.A.: An algorithm for searching for a global minimum of a function. USSR Comput. Math. Math. Phys. 12, 888\u2013896 (1972). (in Russian)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"20_CR36","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2502-5","volume-title":"Global Optimization in Action (Continuous and Lipschitz Optimization: Algorithms, Implementations and Applications)","author":"JD Pint\u00e9r","year":"1996","unstructured":"Pint\u00e9r, J.D.: Global Optimization in Action (Continuous and Lipschitz Optimization: Algorithms, Implementations and Applications). Kluwer Academic Publishers, Dordrecht (1996)"},{"key":"20_CR37","doi-asserted-by":"crossref","unstructured":"Sabo, K., Scitovski, R., Vazler, I.: One-dimensional center-based $$l_1$$ -clustering method. Optim. Lett. (accepted) doi: 10.1007\/s11590-011-0389-9","DOI":"10.1007\/s11590-011-0389-9"},{"key":"20_CR38","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.cor.2009.03.031","volume":"37","author":"A Sch\u00f6bel","year":"2010","unstructured":"Sch\u00f6bel, A., Scholz, D.: The big cube small cube solution method for multidimensional facility location problems. Comput. Oper. Res. 37, 115\u2013122 (2010)","journal-title":"Comput. Oper. Res."},{"key":"20_CR39","unstructured":"Sergeyev, Y.D., Kvasov, D.E.: Diagonal Global Optimization Methods. FizMatLit, Moscow (2008) (in Russian)"},{"key":"20_CR40","first-page":"2812","volume-title":"Wiley Encyclopedia of Operations Research and Management Science","author":"YD Sergeyev","year":"2011","unstructured":"Sergeyev, Y.D., Kvasov, D.E.: Lipschitz global optimization. In: Cochran, J. (ed.) Wiley Encyclopedia of Operations Research and Management Science, vol. 4, pp. 2812\u20132828. Wiley, New York (2011)"},{"key":"20_CR41","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1023\/A:1012391611462","volume":"21","author":"YD Sergeyev","year":"2001","unstructured":"Sergeyev, Y.D., Famularo, D., Pugliese, P.: Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints. J. Glob. Optim. 21, 317\u2013341 (2001)","journal-title":"J. Glob. Optim."},{"key":"20_CR42","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1137\/040621132","volume":"16","author":"YD Sergeyev","year":"2006","unstructured":"Sergeyev, Y.D., Kvasov, D.E.: Global search based on efficient diagonal partitions and a set of Lipschitz constants. SIAM J. Optim. 16, 910\u2013937 (2006)","journal-title":"SIAM J. Optim."},{"key":"20_CR43","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1137\/0709036","volume":"9","author":"B Shubert","year":"1972","unstructured":"Shubert, B.: A sequential method seeking the global maximum of a function. SIAM J. Numer. Anal. 9, 379\u2013388 (1972)","journal-title":"SIAM J. Numer. Anal."},{"key":"20_CR44","volume-title":"Cluster-Formation und Analyse","author":"H Sp\u00e4th","year":"1983","unstructured":"Sp\u00e4th, H.: Cluster-Formation und Analyse. R. Oldenburg Verlag, M\u00fcnchen (1983)"},{"key":"20_CR45","volume-title":"Numerical Methods in Multiextremal Problems","author":"RG Strongin","year":"1978","unstructured":"Strongin, R.G.: Numerical Methods in Multiextremal Problems. Nauka, Moscow (1978). (in Russian)"},{"key":"20_CR46","doi-asserted-by":"crossref","unstructured":"Strongin, R.G., Sergeyev, Y.D.: Global Optimization with Non-Convex Constraints: Sequential and Parallel Algorithms. Kluwer Academic Publishers, Dordrecht (2000)","DOI":"10.1007\/978-1-4615-4677-1"},{"key":"20_CR47","first-page":"65","volume":"8","author":"M Teboulle","year":"2007","unstructured":"Teboulle, M.: A unified continuous optimization framework for center-based clustering methods. J. Mach. Learn. Res. 8, 65\u2013102 (2007)","journal-title":"J. Mach. Learn. Res."},{"key":"20_CR48","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1023\/A:1008395413111","volume":"14","author":"RJ Vanderbei","year":"1999","unstructured":"Vanderbei, R.J.: Extension of piyavskii\u2019s algorithm to continuous global optimization. J. Glob. Optim. 14, 205\u2013216 (1999)","journal-title":"J. Glob. Optim."},{"key":"20_CR49","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/j.ejor.2005.12.045","volume":"183","author":"V Volkovich","year":"2007","unstructured":"Volkovich, V., Kogan, J., Nicholas, C.: Building initial partitions through sampling techniques. Eur. J. Oper. Res. 183, 1097\u20131105 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR50","first-page":"91","volume":"8","author":"GR Wood","year":"1996","unstructured":"Wood, G.R., Zhang, B.P.: Estimation of the Lipschitz constant of a function. J. Glob. Optim. 8, 91\u2013103 (1996)","journal-title":"J. Glob. Optim."},{"key":"20_CR51","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.cam.2004.08.005","volume":"177","author":"Y Wu","year":"2005","unstructured":"Wu, Y., Ozdamar, L., Kumar, A.: Triopt: A triangulation-based partitioning algorithm for global optimization. J. Comput. Appl. Math. 177, 35\u201353 (2005)","journal-title":"J. Comput. Appl. Math."},{"key":"20_CR52","doi-asserted-by":"crossref","unstructured":"Yang, X.S.: Firefly algorithms for multimodal optimization. In: Proceedings of the 5th International Conference on Stochastic Algorithms: Foundations and Applications, pp. 169\u2013178 (2009)","DOI":"10.1007\/978-3-642-04944-6_14"},{"key":"20_CR53","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.cam.2009.06.020","volume":"232","author":"Y Zhang","year":"2009","unstructured":"Zhang, Y., Xua, Y., Zhang, L.: A filled function method applied to nonsmooth constrained global optimization. J. Comput. Appl. Math. 232, 415\u2013426 (2009)","journal-title":"J. Comput. Appl. Math."},{"key":"20_CR54","volume-title":"Stochastic Global Optimization","author":"A Zhigljavsky","year":"2008","unstructured":"Zhigljavsky, A., \u017dilinskas, A.: Stochastic Global Optimization. Springer, Berlin (2008)"},{"key":"20_CR55","first-page":"215","volume":"13","author":"S Zlobec","year":"2008","unstructured":"Zlobec, S.: The fundamental theorem of calculus for Lipschitz functions. Math. Commun. 13, 215\u2013232 (2008)","journal-title":"Math. Commun."},{"key":"20_CR56","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/s10898-011-9648-7","volume":"50","author":"S Zlobec","year":"2011","unstructured":"Zlobec, S.: Equivalent formulations of the gradient. J. Glob. Optim. 50, 549\u2013553 (2011)","journal-title":"J. Glob. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-0020-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-012-0020-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-0020-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,4]],"date-time":"2022-02-04T14:00:06Z","timestamp":1643983206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-012-0020-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,23]]},"references-count":56,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["20"],"URL":"https:\/\/doi.org\/10.1007\/s10898-012-0020-3","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,23]]}}}