{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T09:05:56Z","timestamp":1725613556604},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642240003"},{"type":"electronic","value":"9783642240010"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24001-0_27","type":"book-chapter","created":{"date-parts":[[2011,9,24]],"date-time":"2011-09-24T08:20:15Z","timestamp":1316852415000},"page":"293-301","source":"Crossref","is-referenced-by-count":3,"title":["Penalty Fuzzy Function for Derivative-Free Optimization"],"prefix":"10.1007","author":[{"given":"J.","family":"Matias","sequence":"first","affiliation":[]},{"given":"P.","family":"Mestre","sequence":"additional","affiliation":[]},{"given":"A.","family":"Correia","sequence":"additional","affiliation":[]},{"given":"P.","family":"Couto","sequence":"additional","affiliation":[]},{"given":"C.","family":"Serodio","sequence":"additional","affiliation":[]},{"given":"P.","family":"Melo-Pinto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"27_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/B:OPTE.0000033370.66768.a9","volume":"2","author":"C. Audet","year":"2004","unstructured":"Audet, C.: Convergence results for pattern search algorithms are tight. Optimization and Engineering\u00a02(5), 101\u2013122 (2004)","journal-title":"Optimization and Engineering"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10898-007-9234-1","volume":"41","author":"C. Audet","year":"2008","unstructured":"Audet, C., Bchard, V., Digabel, S.L.: Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search. J. Global Opt.\u00a0(41), 299\u2013318 (2008)","journal-title":"J. Global Opt."},{"issue":"14","key":"27_CR3","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1137\/S105262340138983X","volume":"5","author":"C. Audet","year":"2004","unstructured":"Audet, C., Dennis, J.: A pattern search filter method for nonlinear programming without derivatives. SIAM Journal on Optimization\u00a05(14), 980\u20131010 (2004)","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"27_CR4","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1137\/S1052623400378742","volume":"13","author":"C. Audet","year":"2002","unstructured":"Audet, C., Dennis Jr., J.E.: Analysis of generalized pattern searches. SIAM Journal on Optimization\u00a013(3), 889\u2013903 (2002)","journal-title":"SIAM Journal on Optimization"},{"key":"27_CR5","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 Journal on Optimization\u00a0(17), 188\u2013217 (2006)","journal-title":"SIAM Journal on Optimization"},{"key":"27_CR6","unstructured":"Audet, C., Dennis, Jr., J.E.: A mads algorithm with a progressive barrier for derivative-free nonlinear programming. Tech. Rep. G-2007-37, Les Cahiers du GERAD, cole Polytechnique de Montral (2007)"},{"key":"27_CR7","unstructured":"Audet, C., Dennis Jr, J.E., Digabel, S.L.: Globalization strategies for mesh adaptative direct search.Tech. Rep. G-2008-74, Les Cahiers du GERAD, cole Polytechnique de Montral (2008)"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/200979.201043","volume":"21","author":"I. Bongartz","year":"1995","unstructured":"Bongartz, I., Conn, A., Gould, N., Toint, P.: Cute: Constrained and unconstrained testing environment. ACM Transactions and Mathematical Software\u00a0(21), 123\u2013160 (1995)","journal-title":"ACM Transactions and Mathematical Software"},{"issue":"2","key":"27_CR9","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1080\/10556780701394169","volume":"23","author":"R.H. Byrd","year":"2008","unstructured":"Byrd, R.H., Nocedal, J., Waltz, R.A.: Steering exact penalty methods for nonlinear programming. Optimization Methods & Software\u00a023(2), 197\u2013213 (2008)","journal-title":"Optimization Methods & Software"},{"key":"27_CR10","series-title":"MPS-SIAM Series on Optimization","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to Derivative-Free Optimization","author":"A.R. Conn","year":"2009","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to Derivative-Free Optimization. MPS-SIAM Series on Optimization. SIAM, Philadelphia (2009)"},{"key":"27_CR11","series-title":"Lecture Notes in Engineering and Computer Science","first-page":"1729","volume-title":"World Congress on Engineering 2010","author":"A. Correia","year":"2010","unstructured":"Correia, A., Matias, J., Mestre, P., Serdio, C.: Direct-search penalty\/barrier methods. In: World Congress on Engineering 2010. Lecture Notes in Engineering and Computer Science, vol.\u00a03, pp. 1729\u20131734. IAENG, London (2010)"},{"key":"27_CR12","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: An interior-point l\n                  1-penalty method for nonlinear optimization. Tech. rep., Rutherford Appleton Laboratory Chilton (2003)"},{"issue":"2","key":"27_CR13","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1145\/321062.321069","volume":"8","author":"R. Hooke","year":"1961","unstructured":"Hooke, R., Jeeves, T.: Direct search solution of numerical and statistical problems. Journal of the Association for Computing Machinery\u00a08(2), 212\u2013229 (1961)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1137\/S003614450242889","volume":"45","author":"T. Kolda","year":"2003","unstructured":"Kolda, T., Lewis, R., Torczon, V.: Optimization by direct search: New perspectives on some classical and modern methods. SIAM Review\u00a045, 385\u2013482 (2003)","journal-title":"SIAM Review"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0377-0427(00)00423-4","volume":"124","author":"R. Lewis","year":"2000","unstructured":"Lewis, R., Torczon, V., Trosset, M.: Direct search methods: Then and now. J. Comput. Appl. Math.\u00a0(124), 191\u2013207 (2000)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"27_CR16","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0706028","volume":"6","author":"T. Pietrzykowski","year":"1969","unstructured":"Pietrzykowski, T.: An exact potential method for constrained maxima. SIAM Journal on Numerical Analysis\u00a06(2), 299\u2013304 (1969)","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"27_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61582-5","volume-title":"More Test Examples for Nonlinear Programming Codes, Economics and Mathematical Systems","author":"K. Schittkowski","year":"1987","unstructured":"Schittkowski, K.: More Test Examples for Nonlinear Programming Codes, Economics and Mathematical Systems. Springer, Heidelberg (1987)"}],"container-title":["Advances in Intelligent and Soft Computing","Eurofuse 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24001-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,7]],"date-time":"2019-04-07T20:04:51Z","timestamp":1554667491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24001-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642240003","9783642240010"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24001-0_27","relation":{},"ISSN":["1867-5662","1867-5670"],"issn-type":[{"type":"print","value":"1867-5662"},{"type":"electronic","value":"1867-5670"}],"subject":[],"published":{"date-parts":[[2011]]}}}