{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:37:54Z","timestamp":1765960674148},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,4,6]],"date-time":"2011-04-06T00:00:00Z","timestamp":1302048000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10589-011-9405-3","type":"journal-article","created":{"date-parts":[[2011,4,5]],"date-time":"2011-04-05T04:22:24Z","timestamp":1301977344000},"page":"505-526","source":"Crossref","is-referenced-by-count":39,"title":["Derivative-free methods for bound constrained mixed-integer optimization"],"prefix":"10.1007","volume":"53","author":[{"given":"G.","family":"Liuzzi","sequence":"first","affiliation":[]},{"given":"S.","family":"Lucidi","sequence":"additional","affiliation":[]},{"given":"F.","family":"Rinaldi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,4,6]]},"reference":[{"issue":"1","key":"9405_CR1","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s11590-008-0089-2","volume":"3","author":"M.A. Abramson","year":"2009","unstructured":"Abramson, M.A., Audet, C., Chrissis, J.W., Walston, J.G.: Mesh adaptive direct search algorithms for mixed variable optimization. Optim. Lett. 3(1), 35\u201347 (2009)","journal-title":"Optim. Lett."},{"key":"9405_CR2","unstructured":"Abramson, M.A., Audet, C., Couture, G., Dennis, J.E. Jr., Le Digabel, S.: The NOMAD project. Software available at http:\/\/www.gerad.ca\/nomad"},{"issue":"3","key":"9405_CR3","first-page":"477","volume":"3","author":"M.A. Abramson","year":"2007","unstructured":"Abramson, M.A., Audet, C., Dennis, J.E. Jr.: Filter pattern search algorithms for mixed variable constrained optimization problems. Pac. J. Optim. 3(3), 477\u2013500 (2007)","journal-title":"Pac. J. Optim."},{"issue":"1","key":"9405_CR4","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/040603371","volume":"17","author":"C. Audet","year":"2006","unstructured":"Audet, C., Dennis, J.E. Jr.: Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17(1), 188\u2013217 (2006)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"9405_CR5","doi-asserted-by":"crossref","first-page":"980","DOI":"10.1137\/S105262340138983X","volume":"14","author":"C. Audet","year":"2004","unstructured":"Audet, C., Dennis, J.E. Jr.: A pattern search filter method for nonlinear programming without derivatives. SIAM J. Optim. 14(4), 980\u20131010 (2004)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9405_CR6","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1137\/S1052623499352024","volume":"11","author":"C. Audet","year":"2001","unstructured":"Audet, C., Dennis, J.E. Jr.: Pattern search algorithms for mixed variable programming. SIAM J. Optim. 11(3), 573\u2013594 (2001)","journal-title":"SIAM J. Optim."},{"key":"9405_CR7","volume-title":"Towards Global Optimization","author":"L.C.W. Dixon","year":"1975","unstructured":"Dixon, L.C.W., Szeg\u00f6, G.P.: Towards Global Optimization, vol.\u00a02. North Holland, Amsterdam (1975)"},{"key":"9405_CR8","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1093\/imanum\/15.4.585","volume":"15","author":"C. Elster","year":"1995","unstructured":"Elster, C., Neumaier, A.: A grid algorithm for bound-constrained optimization of noisy functions. IMA J. Numer. Anal. 15, 585\u2013608 (1995)","journal-title":"IMA J. Numer. Anal."},{"key":"9405_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3040-1","volume-title":"Handbook of Test Problems for Local and Global Optimization","author":"C.A. Floudas","year":"1999","unstructured":"Floudas, C.A., Pardalos, P.M., Adjiman, C.S., Esposito, W.R., Gumus, Z., Harding, S.T., Klepeis, J.L., Meyer, C.A., Schweiger, C.A.: Handbook of Test Problems for Local and Global Optimization. Kluwer Academic, Dordrecht (1999)"},{"key":"9405_CR10","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-48320-2","volume-title":"Test Examples for Nonlinear Programming Codes","author":"W. Hock","year":"1981","unstructured":"Hock, W., Schittkowski, K.: Test Examples for Nonlinear Programming Codes. Lecture Notes in Economics and Mathematical Systems, vol.\u00a0187. Springer, Berlin (1981)"},{"key":"9405_CR11","doi-asserted-by":"crossref","unstructured":"Le Digabel, S.: Algorithm 909: NOMAD: Nonlinear optimization with the MADS algorithm. ACM Trans. Math. Softw. 37(4) (2010)","DOI":"10.1145\/1916461.1916468"},{"key":"9405_CR12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10957-008-9489-9","volume":"141","author":"C.-J. Lin","year":"2009","unstructured":"Lin, C.-J., Lucidi, S., Palagi, L., Risi, A., Sciandrone, M.: A decomposition algorithm model for singly linearly constrained problems subject to lower and upper bounds. J. Optim. Theory Appl. 141, 107\u2013126 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"9405_CR13","unstructured":"Liuzzi, G., Lucidi, S., Sciandrone, M.: Sequential penalty derivative-free methods for nonlinear constrained optimization. TR 01\/2009 Dip. di Sistemi e Informatica, Universit\u00e0 degli Studi di Firenze (2009)"},{"key":"9405_CR14","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1137\/S1052623403429573","volume":"14","author":"S. Lucidi","year":"2005","unstructured":"Lucidi, S., Piccialli, V., Sciandrone, M.: An algorithm model for mixed variable programming. SIAM J. Optim. 14, 1057\u20131084 (2005)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9405_CR15","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1023\/A:1013735414984","volume":"21","author":"S. Lucidi","year":"2002","unstructured":"Lucidi, S., Sciandrone, M.: A derivative-free algorithm for bound constrained optimization. Comput. Optim. Appl. 21(2), 119\u2013142 (2002)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"9405_CR16","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s101070100266","volume":"92","author":"S. Lucidi","year":"2002","unstructured":"Lucidi, S., Sciandrone, M., Tseng, P.: Objective-derivative-free methods for constrained optimization. Math. Program. 92(1), 37\u201359 (2002)","journal-title":"Math. Program."},{"issue":"4","key":"9405_CR17","doi-asserted-by":"crossref","first-page":"1082","DOI":"10.1137\/S1052623496300507","volume":"9","author":"R.M. Lewis","year":"1999","unstructured":"Lewis, R.M., Torczon, V.: Pattern search algorithms for bound constrained minimization. SIAM J. Optim. 9(4), 1082\u20131099 (1999)","journal-title":"SIAM J. Optim."},{"key":"9405_CR18","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61582-5","volume-title":"More Test Examples for Nonlinear Programming Codes","author":"K. Schittkowski","year":"1987","unstructured":"Schittkowski, K.: More Test Examples for Nonlinear Programming Codes. Lecture Notes in Economics and Mathematical Systems, vol.\u00a0282. Springer, Berlin (1987)"},{"issue":"1","key":"9405_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S1052623493250780","volume":"7","author":"V. Torczon","year":"1997","unstructured":"Torczon, V.: On the convergence of pattern search algorithms. SIAM J. Optim. 7(1), 1\u201325 (1997)","journal-title":"SIAM J. Optim."},{"key":"9405_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-50871-6","volume-title":"Global Optimization","author":"A. T\u00f6rn","year":"1989","unstructured":"T\u00f6rn, A., Zilinskas, A.: Global Optimization. Springer, Berlin (1989)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9405-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-011-9405-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9405-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T13:42:31Z","timestamp":1560087751000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-011-9405-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,6]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["9405"],"URL":"https:\/\/doi.org\/10.1007\/s10589-011-9405-3","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,6]]}}}