{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T19:15:56Z","timestamp":1726514156174},"reference-count":34,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/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":["PDSE 11348\/12-7"],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["477611\/2013-3","308957\/2014-8"],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS 13-19356"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-11-1-0239"],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s13675-017-0081-7","type":"journal-article","created":{"date-parts":[[2017,2,9]],"date-time":"2017-02-09T12:46:14Z","timestamp":1486644374000},"page":"501-527","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On the construction of quadratic models for derivative-free trust-region algorithms"],"prefix":"10.1016","volume":"5","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-8259-6260","authenticated-orcid":false,"given":"Adriano","family":"Verd\u00e9rio","sequence":"first","affiliation":[]},{"given":"ElizabethW.","family":"Karas","sequence":"additional","affiliation":[]},{"given":"LucasG.","family":"Pedroso","sequence":"additional","affiliation":[]},{"given":"Katya","family":"Scheinberg","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1007\/s13675-017-0081-7_CR1","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10589-012-9466-y","article-title":"Evaluating bound-constrained minimization software","volume":"53","author":"Birgin","year":"2012","journal-title":"Comput Optim Appl"},{"issue":"2","key":"10.1007\/s13675-017-0081-7_CR2","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.1137\/110856253","article-title":"Inexact restoration method for derivative-free optimization with smooth constraints","volume":"23","author":"Bueno","year":"2013","journal-title":"SIAM J Optim"},{"issue":"6","key":"10.1007\/s13675-017-0081-7_CR3","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1080\/10556788.2015.1026968","article-title":"A trust-region derivative-free algorithm for constrained optimization","volume":"30","author":"Conejo","year":"2015","journal-title":"Optim Method Softw"},{"key":"10.1007\/s13675-017-0081-7_CR4","first-page":"324","article-title":"Global convergence of trust-region algorithms for convex constrained minimization without derivatives","volume":"220","author":"Conejo","year":"2013","journal-title":"Appl Math Comput"},{"key":"10.1007\/s13675-017-0081-7_CR5","doi-asserted-by":"crossref","unstructured":"Conn AR, Gould NIM, Toint PL (2000) Trust-region methods. MPS-SIAM Series on optimization. Society for industrial and applied mathematics, Philadelphia","DOI":"10.1137\/1.9780898719857"},{"key":"10.1007\/s13675-017-0081-7_CR6","first-page":"387","article-title":"Global convergence of general derivative-free trust-region algorithms to first and second order critical points","volume":"20","author":"Conn","year":"2009","journal-title":"SIAM J Numer Anal"},{"key":"10.1007\/s13675-017-0081-7_CR7","series-title":"Approximation theory and optimization","first-page":"83","article-title":"On the convergence of derivative-free methods for unconstrained optimization: tributes to M.J.D. Powell","author":"Conn","year":"1997"},{"key":"10.1007\/s13675-017-0081-7_CR8","doi-asserted-by":"crossref","unstructured":"Conn AR, Scheinberg K, Toint PL (1998) A derivative free optimization algorithm in practice. In: Proceedings of the 7th AIAA\/USAF\/NASA\/ISSMO symposium on multidisciplinary analysis and optimization, St Louis, CO, USA","DOI":"10.2514\/6.1998-4718"},{"key":"10.1007\/s13675-017-0081-7_CR9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10107-006-0073-5","article-title":"Geometry of interpolation sets in derivative free optimization","volume":"111","author":"Conn","year":"2008","journal-title":"Math Program"},{"issue":"4","key":"10.1007\/s13675-017-0081-7_CR10","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1093\/imanum\/drn046","article-title":"Geometry of sample sets in derivative-free optimization: polynomial regression and undetermined interpolation","volume":"28","author":"Conn","year":"2008","journal-title":"IMA J Numer Anal"},{"issue":"1","key":"10.1007\/s13675-017-0081-7_CR11","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1137\/060673424","article-title":"Global convergence of general derivative-free trust-region algorithms to first and second order critical points","volume":"20","author":"Conn","year":"2009","journal-title":"SIAM J Optim"},{"key":"10.1007\/s13675-017-0081-7_CR12","doi-asserted-by":"crossref","unstructured":"Conn AR, Scheinberg K, Vicente LN (2009c) Introduction to derivative-free optimization. MPS-SIAM series on optimization. Society for industrial and applied mathematics, Philadelphia","DOI":"10.1137\/1.9780898718768"},{"key":"10.1007\/s13675-017-0081-7_CR13","doi-asserted-by":"crossref","unstructured":"Dennis Jr, JE, Schnabel RB (1996) Numerical methods for unconstrained optimization and nonlinear equations (classics in applied mathematics, 16). Society for industrial and applied mathematics","DOI":"10.1137\/1.9781611971200"},{"issue":"2","key":"10.1007\/s13675-017-0081-7_CR14","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","article-title":"Benchmarking optimization software with performance profiles","volume":"91","author":"Dolan","year":"2009","journal-title":"Math Program"},{"key":"10.1007\/s13675-017-0081-7_CR15","unstructured":"Drucker H, Burges CJC, Kaufman L, Smola AJ, Vapnik V (1996) Support vector regression machines. In: Advances in neural information processing systems 9, NIPS, Denver, CO, USA, 2\u20135 December, pp 155\u2013161"},{"issue":"3","key":"10.1007\/s13675-017-0081-7_CR16","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.1007\/s40314-014-0167-2","article-title":"A globally convergent trust-region algorithm for unconstrained derivative-free optimization","volume":"34","author":"Ferreira","year":"2015","journal-title":"Comput Appl Math"},{"key":"10.1007\/s13675-017-0081-7_CR17","doi-asserted-by":"crossref","unstructured":"Ferreira PS, Karas EW, Sachine M, Sobral FNC (2016) Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming. Optimization, to appear","DOI":"10.1080\/02331934.2016.1263629"},{"issue":"4","key":"10.1007\/s13675-017-0081-7_CR18","doi-asserted-by":"crossref","first-page":"1987","DOI":"10.1137\/151005683","article-title":"Trust-region methods without using derivatives: worst case complexity and the non-smooth case","volume":"26","author":"Garmanjani","year":"2016","journal-title":"SIAM J Optimiz"},{"issue":"2","key":"10.1007\/s13675-017-0081-7_CR19","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/s40314-014-0201-4","article-title":"A derivative-free trust-region algorithm for composite nonsmooth optimization","volume":"35","author":"Grapiglia","year":"2016","journal-title":"Comput Appl Math"},{"key":"10.1007\/s13675-017-0081-7_CR20","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1080\/10556788.2010.549231","article-title":"An active set trust-region method for derivative-free nonlinear bound-constrained optimization","volume":"26","author":"Gratton","year":"2011","journal-title":"Optim Method Softw"},{"issue":"3","key":"10.1007\/s13675-017-0081-7_CR21","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1007\/s10589-013-9607-y","article-title":"A derivative-free algorithm for linearly constrained optimization problems","volume":"57","author":"Gumma","year":"2014","journal-title":"Comput Optim Appl"},{"issue":"1","key":"10.1007\/s13675-017-0081-7_CR22","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","article-title":"Testing unconstrained optimization software","volume":"7","author":"Mor\u00e9","year":"1981","journal-title":"ACM Trans Math Softw"},{"key":"10.1007\/s13675-017-0081-7_CR23","series-title":"Numerical optimization. Springer series in operations research","author":"Nocedal","year":"2006"},{"key":"10.1007\/s13675-017-0081-7_CR24","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/s101070100290","article-title":"UOBYQA: unconstrained optimization by quadratic approximation","volume":"92","author":"Powell","year":"2002","journal-title":"Math Program"},{"key":"10.1007\/s13675-017-0081-7_CR25","series-title":"Large-scale nonlinear optimization","first-page":"255","article-title":"The NEWUOA software for unconstrained optimization without derivatives","author":"Powell","year":"2006"},{"key":"10.1007\/s13675-017-0081-7_CR26","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1093\/imanum\/drm047","article-title":"Developments of NEWUOA for minimization without derivatives","volume":"28","author":"Powell","year":"2008","journal-title":"IMA J Numer Anal"},{"key":"10.1007\/s13675-017-0081-7_CR27","unstructured":"Powell MJD (2009) The BOBYQA algorithm for bound constrained optimization without derivatives. Technical Report DAMTP NA2009\/06, Department of Applied Mathematics and Theoretical Physics, University of Cambridge, UK"},{"issue":"2","key":"10.1007\/s13675-017-0081-7_CR28","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/s10589-012-9483-x","article-title":"On the convergence of trust region algorithms for unconstrained minimization without derivatives","volume":"53","author":"Powell","year":"2012","journal-title":"Comput Optim Appl"},{"issue":"3","key":"10.1007\/s13675-017-0081-7_CR29","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s12532-015-0084-4","article-title":"On fast trust region methods for quadratic models with linear constraints","volume":"7","author":"Powell","year":"2015","journal-title":"Math Program Comput"},{"key":"10.1007\/s13675-017-0081-7_CR30","series-title":"Numerical mathematics","author":"Quarteroni","year":"2007"},{"issue":"6","key":"10.1007\/s13675-017-0081-7_CR31","doi-asserted-by":"crossref","first-page":"3512","DOI":"10.1137\/090748536","article-title":"Self-correcting geometry in model-based algorithms for derivative-free unconstrained optimization","volume":"20","author":"Scheinberg","year":"2010","journal-title":"SIAM J Optim"},{"key":"10.1007\/s13675-017-0081-7_CR32","series-title":"Learning with kernels: support vector machines, regularization, optimization and beyond","author":"Sch\u00f6lkopf","year":"2002"},{"issue":"3","key":"10.1007\/s13675-017-0081-7_CR33","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/B:STCO.0000035301.49549.88","article-title":"A tutorial on support vector regression","volume":"14","author":"Smola","year":"2004","journal-title":"Stat Comput"},{"key":"10.1007\/s13675-017-0081-7_CR34","series-title":"Statistical learning theory","author":"Vapnik","year":"1998"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-017-0081-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-017-0081-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000915?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000915?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-017-0081-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T09:23:20Z","timestamp":1648632200000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000915"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["S2192440621000915"],"URL":"https:\/\/doi.org\/10.1007\/s13675-017-0081-7","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2017,12]]},"assertion":[{"value":"30 March 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}
