{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T05:20:20Z","timestamp":1776489620836,"version":"3.51.2"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T00:00:00Z","timestamp":1521158400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s10898-018-0640-3","type":"journal-article","created":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T01:03:26Z","timestamp":1521162206000},"page":"611-637","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Tuning BARON using derivative-free optimization algorithms"],"prefix":"10.1007","volume":"74","author":[{"given":"Jianfeng","family":"Liu","sequence":"first","affiliation":[]},{"given":"Nikolaos","family":"Ploskas","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2087-9131","authenticated-orcid":false,"given":"Nikolaos V.","family":"Sahinidis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,16]]},"reference":[{"key":"640_CR1","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/040603371","volume":"17","author":"C Audet","year":"2006","unstructured":"Audet, C., Dennis Jr., J.E.: Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17, 188\u2013217 (2006)","journal-title":"SIAM J. Optim."},{"key":"640_CR2","first-page":"642","volume":"17","author":"C Audet","year":"2001","unstructured":"Audet, C., Orban, D.: Finding optimal algorithmic parameters using derivative-free optimization. Soc. Ind. Appl. Math. 17, 642\u2013664 (2001)","journal-title":"Soc. Ind. Appl. Math."},{"key":"640_CR3","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1080\/10556780902883184","volume":"24","author":"X Bao","year":"2009","unstructured":"Bao, X., Sahinidis, N.V., Tawarmalani, M.: Multiterm polyhedral relaxations for nonconvex, quadratically-constrained quadratic programs. Optim. Methods Softw. 24, 485\u2013504 (2009)","journal-title":"Optim. Methods Softw."},{"key":"640_CR4","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1023\/A:1013729320435","volume":"21","author":"MC Bartholomew-Biggs","year":"2002","unstructured":"Bartholomew-Biggs, M.C., Parkhurst, S.C., Wilson, S.P.: Using DIRECT to solve an aircraft routing problem. Comput. Optim. Appl. 21, 311\u2013323 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"640_CR5","unstructured":"Baz, M., Hunsaker, B.: Automated Tuning of Optimization Software Parameters. Technical report. Department of Industrial Engineering, University of Pittsburgh, Pittsburgh, PA (2007)"},{"key":"640_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10589-009-9238-5","volume":"48","author":"M Baz","year":"2011","unstructured":"Baz, M., Hunsaker, B., Prokopyev, O.: How much do we \u201cpay\u201d for using default parameters? Comput. Optim. Appl. 48, 91\u2013108 (2011)","journal-title":"Comput. Optim. Appl."},{"key":"640_CR7","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1287\/ijoc.15.1.114.15159","volume":"15","author":"MR Bussieck","year":"2003","unstructured":"Bussieck, M.R., Drud, A.S., Meeraus, A.: MINLPLib-A collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput. 15, 114\u2013119 (2003)","journal-title":"INFORMS J. Comput."},{"key":"640_CR8","doi-asserted-by":"publisher","first-page":"3907","DOI":"10.1021\/ie100826y","volume":"50","author":"W Chen","year":"2011","unstructured":"Chen, W., Shao, Z., Wang, K., Chen, X., Biegler, L.T.: Random sampling-based automatic parameter tuning for nonlinear programming solvers. Ind. Eng. Chem. Res. 50, 3907\u20133918 (2011)","journal-title":"Ind. Eng. Chem. Res."},{"key":"640_CR9","first-page":"83","volume-title":"Approximation Theory and Optimization, Tribute to M. J. D. Powell","author":"AR Conn","year":"1996","unstructured":"Conn, A.R., Scheinberg, K., Toint, P.L.: On the convergence of derivative-free methods for unconstrained optimization. In: Buhmann, M.D., Iserles, A. (eds.) Approximation Theory and Optimization, Tribute to M. J. D. Powell, pp. 83\u2013108. Cambridge University Press, Cambridge (1996)"},{"key":"640_CR10","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1093\/imanum\/drn045","volume":"28","author":"AL Cust\u00f3dio","year":"2008","unstructured":"Cust\u00f3dio, A.L., Dennis Jr., J.E., Vicente, L.N.: Using simplex gradients of nonsmooth functions in direct search methods. IMA J. Numer. Anal. 28, 770\u2013784 (2008)","journal-title":"IMA J. Numer. Anal."},{"key":"640_CR11","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1016\/j.ejor.2006.06.034","volume":"181","author":"SS Fan","year":"2007","unstructured":"Fan, S.S., Zahara, E.: A hybrid simplex search and particle swarm optimization for unconstrained optimization. Eur. J. Oper. Res. 181, 527\u2013548 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"640_CR12","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1016\/j.advwatres.2008.01.010","volume":"31","author":"KR Fowler","year":"2008","unstructured":"Fowler, K.R., Reese, J.P., Kees, C.E., Dennis Jr., J.E., Kelley, C.T., Miller, C.T., Audet, C., Booker, A.J., Couture, G., Darwin, R.W., Farthing, M.W., Finkel, D.E., Gablonsky, J.M., Gray, G., Kolda, T.G.: A comparison of derivative-free optimization methods for groundwater supply and hydraulic capture community problems. Adv. Water Resour. 31, 743\u2013757 (2008)","journal-title":"Adv. Water Resour."},{"key":"640_CR13","unstructured":"GLOBAL Library. \n                    http:\/\/www.gamsworld.org\/global\/globallib.htm\n                    \n                  . Accessed 25 Feb 2018"},{"key":"640_CR14","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1023\/A:1011255519438","volume":"19","author":"HM Gutmann","year":"2001","unstructured":"Gutmann, H.M.: A radial basis function method for global optimization. J. Glob. Optim. 19, 201\u2013227 (2001)","journal-title":"J. Glob. Optim."},{"key":"640_CR15","doi-asserted-by":"publisher","first-page":"041014","DOI":"10.1115\/1.2890106","volume":"5","author":"J Han","year":"2008","unstructured":"Han, J., Kokkolaras, M., Papalambros, P.Y.: Optimal design of hybrid fuel cell vehicles. J. Fuel Cell Sci. Technol. 5, 041014 (2008)","journal-title":"J. Fuel Cell Sci. Technol."},{"key":"640_CR16","first-page":"1152","volume-title":"Proceedings of the 22nd National Conference on Artificial Intelligence","author":"F Hutter","year":"2007","unstructured":"Hutter, F., Hoos, H.H., St\u00fctzle, T.: Automatic algorithm configuration based on local search. In: Howe, A., Holte, R.C. (eds.) Proceedings of the 22nd National Conference on Artificial Intelligence, pp. 1152\u20131157. AAAI Press, Menlo Park, CA (2007)"},{"key":"640_CR17","first-page":"186","volume":"6140","author":"F Hutter","year":"2010","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Automated configuration of mixed integer programming solvers. LNCS 6140, 186\u2013202 (2010)","journal-title":"LNCS"},{"key":"640_CR18","doi-asserted-by":"crossref","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configurations. In: Coello, C.A.C. (ed.) Learning and Intelligent Optimization, pp. 507\u2013523. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-25566-3_40"},{"key":"640_CR19","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., St\u00fctzle, T.: ParamILS: an antomatic algorithm configuration framework. J. Artif. Intell. Res. 36, 267\u2013306 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"640_CR20","doi-asserted-by":"publisher","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":"640_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ejor.2008.01.039","volume":"195","author":"LM Hvattum","year":"2009","unstructured":"Hvattum, L.M., Glover, F.: Finding local optima of high-dimensional functions using direct search methods. Eur. J. Oper. Res. 195, 31\u201345 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"640_CR22","unstructured":"Ingber, L.: Adaptive Simulated Annealing (ASA). \n                    http:\/\/www.ingber.com\/#ASA\n                    \n                  . Accessed 25 Feb 2018"},{"key":"640_CR23","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":"640_CR24","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-1-4757-5331-8_7","volume-title":"Global Optimization in Engineering Design","author":"ML Liu","year":"1996","unstructured":"Liu, M.L., Sahinidis, N.V., Shectman, J.P.: Planning of chemical process networks via global concave minimization. In: Grossmann, I.E. (ed.) Global Optimization in Engineering Design, pp. 195\u2013230. Kluwer Academic Publishers, Boston (1996)"},{"key":"640_CR25","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1080\/10556780008805783","volume":"13","author":"M Mongeau","year":"2000","unstructured":"Mongeau, M., Karsenty, H., Rouz\u00e9, V., Hiriart-Urruty, J.B.: Comparison of public-domain software for black box global optimization. Optim. Methods Softw. 13, 203\u2013226 (2000)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"640_CR26","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/080724083","volume":"20","author":"JM Mor\u00e9","year":"2009","unstructured":"Mor\u00e9, J.M., Wild, S.M.: Benchmarking derivative-free optimization algorithms. SIAM. J. Optim. 20(1), 172\u2013191 (2009)","journal-title":"SIAM. J. Optim."},{"key":"640_CR27","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder, J.A., Mead, R.: A simplex method for function minimization. Comput. J. 7, 308\u2013313 (1965)","journal-title":"Comput. J."},{"key":"640_CR28","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-94-015-8330-5_4","volume-title":"Advances in Optimization and Numerical Analysis","author":"MJD Powell","year":"1994","unstructured":"Powell, M.J.D.: A direct search optimization method that models the objective and constraint functions by linear interpolation. In: Gomez, S., Hennart, J.P. (eds.) Advances in Optimization and Numerical Analysis, pp. 51\u201367. Kluwer Academic, Dordrecht (1994)"},{"key":"640_CR29","doi-asserted-by":"crossref","unstructured":"Powell, M.J.D.: Recent research at Cambridge on radial basis functions. Technical report. Department of Applied Mathematics and Theoretical Physics, University of Cambridge (1998)","DOI":"10.1007\/978-3-0348-8696-3_14"},{"key":"640_CR30","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10898-016-0491-8","volume":"67","author":"Y Puranik","year":"2017","unstructured":"Puranik, Y., Sahinidis, N.V.: Bounds tightening based on optimality conditions for nonconvex box-constrained optimization. J. Glob. Optim. 67, 59\u201377 (2017)","journal-title":"J. Glob. Optim."},{"key":"640_CR31","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/s10601-016-9267-5","volume":"22","author":"Y Puranik","year":"2017","unstructured":"Puranik, Y., Sahinidis, N.V.: Domain reduction techniques for global NLP and MINLP optimization. Constraints 22, 338\u2013376 (2017)","journal-title":"Constraints"},{"key":"640_CR32","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1007\/s10898-012-9951-y","volume":"56","author":"LM Rios","year":"2013","unstructured":"Rios, L.M., Sahinidis, N.V.: Derivative-free optimization: a review of algorithms and comparison of software implementations. J. Glob. Optim. 56, 1247\u20131293 (2013)","journal-title":"J. Glob. Optim."},{"key":"640_CR33","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/0098-1354(94)00097-2","volume":"19","author":"HS Ryoo","year":"1995","unstructured":"Ryoo, H.S., Sahinidis, N.V.: Global optimization of nonconvex NLPs and MINLPs with applications in process design. Comput. Chem. Eng. 19, 551\u2013566 (1995)","journal-title":"Comput. Chem. Eng."},{"key":"640_CR34","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF00138689","volume":"8","author":"HS Ryoo","year":"1996","unstructured":"Ryoo, H.S., Sahinidis, N.V.: A branch-and-reduce approach to global optimization. J. Glob. Optim. 8, 107\u2013139 (1996)","journal-title":"J. Glob. Optim."},{"key":"640_CR35","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"NV Sahinidis","year":"1996","unstructured":"Sahinidis, N.V.: BARON: a general purpose global optimization software package. J. Glob. Optim. 8, 201\u2013205 (1996)","journal-title":"J. Glob. Optim."},{"key":"640_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-39901-8_1","volume-title":"Global Optimization and Constraint Satisfaction. Lecture Notes in Computer Science","author":"NV Sahinidis","year":"2003","unstructured":"Sahinidis, N.V.: Global optimization and constraint satisfaction: the branch-and-reduce approach. In: Bliek, C., Jermann, C., Neumaier, A. (eds.) Global Optimization and Constraint Satisfaction. Lecture Notes in Computer Science, vol. 2861, pp. 1\u201316. Springer, Berlin (2003)"},{"key":"640_CR37","unstructured":"Sahinidis, N.V.: BARON 15.5.0: Global Optimization of Mixed-Integer Nonlinear Programs, User\u2019s Manual (2015)"},{"key":"640_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1008241411395","volume":"12","author":"JP Shectman","year":"1998","unstructured":"Shectman, J.P., Sahinidis, N.V.: A finite algorithm for global minimization of separable concave programs. J. Glob. Optim. 12, 1\u201336 (1998)","journal-title":"J. Glob. Optim."},{"key":"640_CR39","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1080\/00401706.1962.10490033","volume":"4","author":"W Spendley","year":"1962","unstructured":"Spendley, W., Hext, G.R., Himsworth, F.R.: Sequential application for simplex designs in optimisation and evolutionary operation. Technometrics 4, 441\u2013461 (1962)","journal-title":"Technometrics"},{"key":"640_CR40","unstructured":"Stewart, C.R.: Master\u2019s thesis. Vriginia Commonwealth University, Richmond, VA (2010)"},{"key":"640_CR41","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/A:1021043227181","volume":"3","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Ahmed, S., Sahinidis, N.V.: Product disaggregation and relaxations of mixed-integer rational programs. Optim. Eng. 3, 281\u2013303 (2002)","journal-title":"Optim. Eng."},{"key":"640_CR42","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10107-002-0308-z","volume":"93","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convex extensions and convex envelopes of l.s.c. functions. Math. Program. 93, 247\u2013263 (2002)","journal-title":"Math. Program."},{"key":"640_CR43","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"M Tawarmalani","year":"2004","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math. Program. 99, 563\u2013591 (2004)","journal-title":"Math. Program."},{"key":"640_CR44","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103, 225\u2013249 (2005)","journal-title":"Math. Program."},{"key":"640_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S1052623493250780","volume":"7","author":"VJ Torczon","year":"1997","unstructured":"Torczon, V.J.: On the convergence of pattern search algorithms. SIAM J. Optim. 7, 1\u201325 (1997)","journal-title":"SIAM J. Optim."},{"key":"640_CR46","unstructured":"Vaz, A.I.F.: PSwarm Home Page. \n                    http:\/\/www.norg.uminho.pt\/aivaz\/pswarm\/\n                    \n                  . Accessed 25 Feb 2018"},{"key":"640_CR47","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10898-007-9133-5","volume":"39","author":"AIF Vaz","year":"2007","unstructured":"Vaz, A.I.F., Vicente, L.N.: A particle swarm pattern search method for bound constrained global optimization. J. Glob. Optim. 39, 197\u2013219 (2007)","journal-title":"J. Glob. Optim."},{"key":"640_CR48","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1080\/10556788.2013.783032","volume":"29","author":"K Zorn","year":"2013","unstructured":"Zorn, K., Sahinidis, N.V.: Global optimization of general nonconvex problems with intermediate bilinear substructures. Optim. Methods Softw. 29, 442\u2013462 (2013)","journal-title":"Optim. Methods Softw."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0640-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-018-0640-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-018-0640-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T03:20:50Z","timestamp":1565580050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-018-0640-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,16]]},"references-count":48,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["640"],"URL":"https:\/\/doi.org\/10.1007\/s10898-018-0640-3","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,16]]},"assertion":[{"value":"1 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}