{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T11:52:39Z","timestamp":1768477959544,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,22]],"date-time":"2022-01-22T00:00:00Z","timestamp":1642809600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,22]],"date-time":"2022-01-22T00:00:00Z","timestamp":1642809600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["88881.135273\/2016-01"],"award-info":[{"award-number":["88881.135273\/2016-01"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["88881.119526\/2016-01"],"award-info":[{"award-number":["88881.119526\/2016-01"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s40314-021-01748-4","type":"journal-article","created":{"date-parts":[[2022,1,22]],"date-time":"2022-01-22T03:03:11Z","timestamp":1642820591000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A derivative-free exact penalty algorithm: basic ideas, convergence theory and computational studies"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9819-5974","authenticated-orcid":false,"given":"Caio Merlini","family":"Giuliani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Camponogara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew R.","family":"Conn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,22]]},"reference":[{"issue":"2","key":"1748_CR1","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1137\/080716980","volume":"20","author":"MA Abramson","year":"2009","unstructured":"Abramson MA, Audet C, Dennis JE Jr, Digabel SL (2009) OrthoMADS: a deterministic MADS instance with orthogonal directions. SIAM J Optim 20(2):948\u2013966. https:\/\/doi.org\/10.1137\/080716980","journal-title":"SIAM J Optim"},{"issue":"1","key":"1748_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ejor.2017.10.058","volume":"268","author":"N Amaioua","year":"2018","unstructured":"Amaioua N, Audet C, Conn AR, Digabel SL (2018) Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm. Eur J Oper Res 268(1):13\u201324. https:\/\/doi.org\/10.1016\/j.ejor.2017.10.058","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1748_CR3","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1137\/070692662","volume":"20","author":"C Audet","year":"2009","unstructured":"Audet C, Dennis JE Jr (2009) A progressive barrier for derivative-free nonlinear programming. SIAM J Optim 20(1):445\u2013472. https:\/\/doi.org\/10.1137\/070692662","journal-title":"SIAM J Optim"},{"issue":"8","key":"1748_CR4","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.ifacol.2018.06.375","volume":"51","author":"E Camponogara","year":"2018","unstructured":"Camponogara E, Machado AS, Silva TL, Giuliani CM, Vieira BF, Teixeira AF (2018) Derivative-free optimization of offshore production platforms sharing a subsea gas network. IFAC-PapersOnLine 51(8):185\u2013190. https:\/\/doi.org\/10.1016\/j.ifacol.2018.06.375","journal-title":"IFAC-PapersOnLine"},{"issue":"1","key":"1748_CR5","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/bf01581639","volume":"19","author":"TF Coleman","year":"1980","unstructured":"Coleman TF, Conn AR (1980) Second-order conditions for an exact penalty function. Math Programm 19(1):178\u2013185. https:\/\/doi.org\/10.1007\/bf01581639","journal-title":"Math Programm"},{"issue":"1","key":"1748_CR6","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/bf01585101","volume":"24","author":"TF Coleman","year":"1982","unstructured":"Coleman TF, Conn AR (1982) Nonlinear programming via an exact penalty function: global analysis. Math Programm 24(1):137\u2013161. https:\/\/doi.org\/10.1007\/bf01585101","journal-title":"Math Programm"},{"key":"1748_CR7","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.amc.2013.06.041","volume":"220","author":"PD Conejo","year":"2013","unstructured":"Conejo PD, Karas EW, Pedroso LG, Ribeiro AA, Sachine M (2013) Global convergence of trust-region algorithms for convex constrained minimization without derivatives. Appl Math Comput 220:324\u2013330. https:\/\/doi.org\/10.1016\/j.amc.2013.06.041","journal-title":"Appl Math Comput"},{"issue":"1\u20133","key":"1748_CR8","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/bf02614326","volume":"79","author":"AR Conn","year":"1997","unstructured":"Conn AR, Scheinberg K, Toint PL (1997) Recent progress in unconstrained nonlinear optimization without derivatives. Math Programm 79(1\u20133):397\u2013414. https:\/\/doi.org\/10.1007\/bf02614326","journal-title":"Math Programm"},{"issue":"1\u20132","key":"1748_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10107-006-0073-5","volume":"111","author":"AR Conn","year":"2008","unstructured":"Conn AR, Scheinberg K, Vicente LN (2008) Geometry of interpolation sets in derivative free optimization. Math Programm 111(1\u20132):141\u2013172. https:\/\/doi.org\/10.1007\/s10107-006-0073-5","journal-title":"Math Programm"},{"issue":"4","key":"1748_CR10","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1093\/imanum\/drn046","volume":"28","author":"AR Conn","year":"2008","unstructured":"Conn AR, Scheinberg K, Vicente LN (2008) Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation. IMA J Numer Anal 28(4):721\u2013748. https:\/\/doi.org\/10.1093\/imanum\/drn046","journal-title":"IMA J Numer Anal"},{"issue":"1","key":"1748_CR11","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1137\/060673424","volume":"20","author":"AR Conn","year":"2009","unstructured":"Conn AR, Scheinberg K, Vicente LN (2009) Global convergence of general derivative-free trust-region algorithms to first- and second-order critical points. SIAM J Optim 20(1):387\u2013415. https:\/\/doi.org\/10.1137\/060673424","journal-title":"SIAM J Optim"},{"key":"1748_CR12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768","author":"AR Conn","year":"2009","unstructured":"Conn AR, Scheinberg K, Vicente LN (2009) Introduction to derivative-free optimization. Soc Ind Appl Math. https:\/\/doi.org\/10.1137\/1.9780898718768","journal-title":"Soc Ind Appl Math"},{"issue":"1","key":"1748_CR13","first-page":"19","volume":"30","author":"MA Diniz-Ehrhardt","year":"2011","unstructured":"Diniz-Ehrhardt MA, Mart\u00ednez JM, Pedroso LG (2011) Derivative-free methods for nonlinear programming with general lower-level constraints. Comput Appl Math 30(1):19\u201352","journal-title":"Comput Appl Math"},{"issue":"3","key":"1748_CR14","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1137\/130940037","volume":"24","author":"G Fasano","year":"2014","unstructured":"Fasano G, Liuzzi G, Lucidi S, Rinaldi F (2014) A linesearch-based derivative-free approach for nonsmooth constrained optimization. SIAM J Optim 24(3):959\u2013992. https:\/\/doi.org\/10.1137\/130940037","journal-title":"SIAM J Optim"},{"issue":"3","key":"1748_CR15","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1137\/s1052623499357258","volume":"13","author":"R Fletcher","year":"2002","unstructured":"Fletcher R, Gould NIM, Leyffer S, Toint PL, W\u00e4chter A (2002) Global convergence of a trust-region SQP-filter algorithm for general nonlinear programming. SIAM J Optim 13(3):635\u2013659. https:\/\/doi.org\/10.1137\/s1052623499357258","journal-title":"SIAM J Optim"},{"key":"1748_CR16","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.compchemeng.2015.01.014","volume":"75","author":"CM Giuliani","year":"2015","unstructured":"Giuliani CM, Camponogara E (2015) Derivative-free methods applied to daily production optimization of gas-lifted oil fields. Comput Chem Eng 75:60\u201364. https:\/\/doi.org\/10.1016\/j.compchemeng.2015.01.014","journal-title":"Comput Chem Eng"},{"issue":"3","key":"1748_CR17","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NIM Gould","year":"2014","unstructured":"Gould NIM, Orban D, Toint PL (2014) CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput Optim Appl 60(3):545\u2013557. https:\/\/doi.org\/10.1007\/s10589-014-9687-3","journal-title":"Comput Optim Appl"},{"issue":"2","key":"1748_CR18","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s40314-014-0201-4","volume":"35","author":"GN Grapiglia","year":"2014","unstructured":"Grapiglia GN, Yuan J, Yx Yuan (2014) A derivative-free trust-region algorithm for composite nonsmooth optimization. Comput Appl Math 35(2):475\u2013499. https:\/\/doi.org\/10.1007\/s40314-014-0201-4","journal-title":"Comput Appl Math"},{"issue":"4","key":"1748_CR19","doi-asserted-by":"publisher","first-page":"1980","DOI":"10.1137\/130917661","volume":"24","author":"S Gratton","year":"2014","unstructured":"Gratton S, Vicente LN (2014) A merit function approach for direct search. SIAM J Optim 24(4):1980\u20131998. https:\/\/doi.org\/10.1137\/130917661","journal-title":"SIAM J Optim"},{"key":"1748_CR20","doi-asserted-by":"publisher","DOI":"10.1093\/amrx\/abq003","author":"JD Griffin","year":"2010","unstructured":"Griffin JD, Kolda TG (2010) Nonlinearly constrained optimization using heuristic penalty methods and asynchronous parallel generating set search. Appl Math Res eXpress. https:\/\/doi.org\/10.1093\/amrx\/abq003","journal-title":"Appl Math Res eXpress"},{"issue":"4","key":"1748_CR21","doi-asserted-by":"publisher","first-page":"3001","DOI":"10.1137\/17m114741x","volume":"28","author":"KA Khan","year":"2018","unstructured":"Khan KA, Larson J, Wild SM (2018) Manifold sampling for optimization of nonconvex functions that are piecewise linear compositions of smooth components. SIAM J Optim 28(4):3001\u20133024. https:\/\/doi.org\/10.1137\/17m114741x","journal-title":"SIAM J Optim"},{"issue":"4","key":"1748_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1916461.1916468","volume":"37","author":"S Le Digabel","year":"2011","unstructured":"Le Digabel S (2011) Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm. ACM Trans Math Softw 37(4):1\u201315. https:\/\/doi.org\/10.1145\/1916461.1916468","journal-title":"ACM Trans Math Softw"},{"issue":"1\u20132","key":"1748_CR23","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/s0377-0427(00)00423-4","volume":"124","author":"RM Lewis","year":"2000","unstructured":"Lewis RM, Torczon V, Trosset MW (2000) Direct search methods: then and now. J Comput Appl Math 124(1\u20132):191\u2013207. https:\/\/doi.org\/10.1016\/s0377-0427(00)00423-4","journal-title":"J Comput Appl Math"},{"issue":"1","key":"1748_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/070711451","volume":"20","author":"G Liuzzi","year":"2009","unstructured":"Liuzzi G, Lucidi S (2009) A derivative-free algorithm for inequality constrained nonlinear programming via smoothing of an $$\\ell _\\infty $$ penalty function. SIAM J Optim 20(1):1\u201329. https:\/\/doi.org\/10.1137\/070711451","journal-title":"SIAM J Optim"},{"key":"1748_CR25","doi-asserted-by":"publisher","unstructured":"Powell MJD (1994) A direct search optimization method that models the objective and constraint functions by linear interpolation. In: Advances in optimization and numerical analysis, pp 51\u201367. Springer Netherlands. https:\/\/doi.org\/10.1007\/978-94-015-8330-5_4","DOI":"10.1007\/978-94-015-8330-5_4"},{"issue":"3","key":"1748_CR26","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1080\/10556788.2015.1135919","volume":"31","author":"PR Sampaio","year":"2016","unstructured":"Sampaio PR, Toint PL (2016) Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints. Optim Methods Softw 31(3):511\u2013534. https:\/\/doi.org\/10.1080\/10556788.2015.1135919","journal-title":"Optim Methods Softw"},{"key":"1748_CR27","volume-title":"Active sets in bound-constrained optimization without derivatives","author":"A Tr\u00f6ltzsch","year":"2012","unstructured":"Tr\u00f6ltzsch A (2012) Active sets in bound-constrained optimization without derivatives. Lambert Academic Publishing, Saarbr\u00fccken"},{"issue":"5","key":"1748_CR28","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1287\/mnsc.13.5.344","volume":"13","author":"WI Zangwill","year":"1967","unstructured":"Zangwill WI (1967) Non-linear programming via penalty functions. Manag Sci 13(5):344\u2013358. https:\/\/doi.org\/10.1287\/mnsc.13.5.344","journal-title":"Manag Sci"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01748-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-021-01748-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01748-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,10]],"date-time":"2022-02-10T10:39:46Z","timestamp":1644489586000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-021-01748-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,22]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["1748"],"URL":"https:\/\/doi.org\/10.1007\/s40314-021-01748-4","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,22]]},"assertion":[{"value":"1 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"56"}}