{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:58:22Z","timestamp":1759939102553},"reference-count":23,"publisher":"Informa UK Limited","issue":"10-11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1080\/00207160902775090","type":"journal-article","created":{"date-parts":[[2009,9,25]],"date-time":"2009-09-25T08:27:21Z","timestamp":1253867241000},"page":"1841-1851","source":"Crossref","is-referenced-by-count":4,"title":["Derivative-free optimization and filter methods to solve nonlinear constrained problems"],"prefix":"10.1080","volume":"86","author":[{"given":"Aldina","family":"Correia","sequence":"first","affiliation":[]},{"given":"Jo\u00e3o","family":"Matias","sequence":"additional","affiliation":[]},{"given":"Pedro","family":"Mestre","sequence":"additional","affiliation":[]},{"given":"Carlos","family":"Ser\u00f4dio","sequence":"additional","affiliation":[]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1137\/S105262340138983X"},{"key":"CIT0002","doi-asserted-by":"crossref","unstructured":"Bongartz, I., Conn, A. R., Gould, N. I. and Toint, P. L. 1995.CUTE: Constrained and Unconstrained Testing Environment123\u2013160. ACM Transactions on Mathematical Software: 21","DOI":"10.1145\/200979.201043"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.658"},{"key":"CIT0004","unstructured":"Byrd, R. H., Nocedal, J. and Waltz, R. A. 2006. \u201cSteering exact penalty methods for optimization\u201d. Evanston, IL, USA: Optimization Technology Center, Northwestern University. Tech. Rep 60208"},{"key":"CIT0005","doi-asserted-by":"crossref","unstructured":"Chen, L. and Goldfarb, D. 2005. \u201cInterior-point l2-penalty methods for nonlinear programming with strong global convergence properties\u201d. New York: IEOR Department, Columbia University. Mathematical Programming, Tech. Rep","DOI":"10.1007\/s10107-005-0701-5"},{"key":"CIT0006","unstructured":"Fletcher, R. and Leyffer, S. 1999. \u201cA bundle filter method for nonsmooth nonlinear optimization\u201d. Dundee University, Department of Mathematics. Tech. Rep. NA\/195"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100244"},{"key":"CIT0008","unstructured":"Fletcher, R., Leyffer, S. and Toint, P. L. 1998. \u201cOn the global convergence of an SLP-filter algorithm\u201d. Dundee University, Department of Mathematics. Tech. Rep. NA\/183"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623499357258"},{"key":"CIT0010","unstructured":"Fletcher, R., Leyffer, S. and Toint, P. L. 2006. \u201cA brief history of filter method\u201d. Argonne National Laboratory, Mathematics and Computer Science Division. Tech. Rep. ANL\/MCS-P1372-0906"},{"key":"CIT0011","unstructured":"Gould, N. I.M., Orban, D. and Toint, P. L. November 2003. \u201cAn interior-point l1-penalty method for nonlinear optimization\u201d. November, Oxfordshire, UK Tech. Rep. RAL-TR-2003-022 Rutherford Appleton Laboratory Chilton"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623403422637"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1137\/040603851"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1145\/321062.321069"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0123-7"},{"key":"CIT0016","volume-title":"Direct Search Methods: Then and Now","author":"Lewis R. M.","year":"2000"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1137\/040621065"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)E0339-Y"},{"key":"CIT0019","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"Nelder J. A.","year":"1965","journal-title":"Comput. J."},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1016\/S0045-7949(03)00301-8"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/7.2.155"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0477-4"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1137\/040612294"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160902775090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T17:02:28Z","timestamp":1558544548000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207160902775090"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11]]},"references-count":23,"journal-issue":{"issue":"10-11","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["10.1080\/00207160902775090"],"URL":"https:\/\/doi.org\/10.1080\/00207160902775090","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11]]}}}