{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T16:48:01Z","timestamp":1779900481554,"version":"3.53.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,8,30]],"date-time":"2016-08-30T00:00:00Z","timestamp":1472515200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001807","name":"FAPESP","doi-asserted-by":"crossref","award":["2010\/10133-0"],"award-info":[{"award-number":["2010\/10133-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001807","name":"FAPESP","doi-asserted-by":"crossref","award":["2013\/03447-6"],"award-info":[{"award-number":["2013\/03447-6"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001807","name":"FAPESP","doi-asserted-by":"crossref","award":["2013\/05475-7"],"award-info":[{"award-number":["2013\/05475-7"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001807","name":"FAPESP","doi-asserted-by":"crossref","award":["2013\/07375-0"],"award-info":[{"award-number":["2013\/07375-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001807","name":"FAPESP","doi-asserted-by":"crossref","award":["2013\/23494-9"],"award-info":[{"award-number":["2013\/23494-9"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["04032\/2010-7"],"award-info":[{"award-number":["04032\/2010-7"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["309517\/2014-1"],"award-info":[{"award-number":["309517\/2014-1"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["303750\/2014-6"],"award-info":[{"award-number":["303750\/2014-6"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["490326\/2013-7"],"award-info":[{"award-number":["490326\/2013-7"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002661","name":"Fonds De La Recherche Scientifique - FNRS (BE)","doi-asserted-by":"publisher","award":["Id"],"award-info":[{"award-number":["Id"]}],"id":[{"id":"10.13039\/501100002661","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10107-016-1065-8","type":"journal-article","created":{"date-parts":[[2016,8,30]],"date-time":"2016-08-30T04:52:59Z","timestamp":1472532779000},"page":"359-368","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":104,"title":["Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models"],"prefix":"10.1007","volume":"163","author":[{"given":"E. G.","family":"Birgin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J. L.","family":"Gardenghi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J. M.","family":"Mart\u00ednez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S. A.","family":"Santos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ph. L.","family":"Toint","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,30]]},"reference":[{"issue":"1","key":"1065_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/080732432","volume":"48","author":"S Bellavia","year":"2010","unstructured":"Bellavia, S., Cartis, C., Gould, N.I.M., Morini, B., Toint, PhL: Convergence of a regularized Euclidean residual algorithm for nonlinear least-squares. SIAM J. Numer. Anal. 48(1), 1\u201329 (2010)","journal-title":"SIAM J. Numer. Anal."},{"key":"1065_CR2","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s10107-014-0753-5","volume":"149","author":"W Bian","year":"2015","unstructured":"Bian, W., Chen, X., Ye, Y.: Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization. Math. Program. Ser. A 149, 301\u2013327 (2015)","journal-title":"Math. Program. Ser. A"},{"issue":"6","key":"1065_CR3","doi-asserted-by":"crossref","first-page":"2833","DOI":"10.1137\/090774100","volume":"20","author":"C Cartis","year":"2010","unstructured":"Cartis, C., Gould, N.I.M., Toint, PhL: On the complexity of steepest descent, Newton\u2019s and regularized Newton\u2019s methods for nonconvex unconstrained optimization. SIAM J. Optim. 20(6), 2833\u20132852 (2010)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1065_CR4","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10107-009-0286-5","volume":"127","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I.M., Toint, PhL: Adaptive cubic overestimation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math. Progr. Ser. A 127(2), 245\u2013295 (2011)","journal-title":"Math. Progr. Ser. A"},{"issue":"2","key":"1065_CR5","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10107-009-0337-y","volume":"130","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I.M., Toint, PhL: Adaptive cubic overestimation methods for unconstrained optimization. Part II: worst-case function-evaluation complexity. Math. Progr. Ser. A 130(2), 295\u2013319 (2011)","journal-title":"Math. Progr. Ser. A"},{"key":"1065_CR6","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Optimal Newton-type methods for nonconvex optimization. Technical Report naXys-17-2011, Namur Center for Complex Systems (naXys), University of Namur, Namur, Belgium (2011)"},{"issue":"4","key":"1065_CR7","doi-asserted-by":"crossref","first-page":"1662","DOI":"10.1093\/imanum\/drr035","volume":"32","author":"C Cartis","year":"2012","unstructured":"Cartis, C., Gould, N.I.M., Toint, PhL: An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity. IMA J. Numer. Anal. 32(4), 1662\u20131695 (2012)","journal-title":"IMA J. Numer. Anal."},{"key":"1065_CR8","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.jco.2011.06.001","volume":"28","author":"C Cartis","year":"2012","unstructured":"Cartis, C., Gould, N.I.M., Toint, PhL: Complexity bounds for second-order optimality in unconstrained optimization. J. Complex. 28, 93\u2013108 (2012)","journal-title":"J. Complex."},{"issue":"2","key":"1065_CR9","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1080\/10556788.2011.602076","volume":"27","author":"C Cartis","year":"2012","unstructured":"Cartis, C., Gould, N.I.M., Toint, PhL: Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization. Optim. Methods Softw. 27(2), 197\u2013219 (2012)","journal-title":"Optim. Methods Softw."},{"key":"1065_CR10","doi-asserted-by":"crossref","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Second-order optimality and beyond: characterization and evaluation complexity in convexly-constrained nonlinear optimization. Part I: a basic complexity bound using a trust-region algorithm. Technical Report (in preparation), Namur Center for Complex Systems (naXys), University of Namur, Namur, Belgium (2016)","DOI":"10.1007\/s10208-017-9363-y"},{"key":"1065_CR11","unstructured":"Dussault, J.P.: Simple unified convergence proofs for the trust-region and a new ARC variant. Technical report, University of Sherbrooke, Sherbrooke, Canada (2015)"},{"key":"1065_CR12","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10107-014-0794-9","volume":"152","author":"GN Grapiglia","year":"2015","unstructured":"Grapiglia, G.N., Yuan, J., Yuan, Y.: On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization. Math. Progr. Ser. A 152, 491\u2013520 (2015)","journal-title":"Math. Progr. Ser. A"},{"issue":"1","key":"1065_CR13","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1137\/050623012","volume":"19","author":"S Gratton","year":"2008","unstructured":"Gratton, S., Sartenaer, A., Toint, PhL: Recursive trust-region methods for multiscale nonlinear optimization. SIAM J. Optim. 19(1), 414\u2013444 (2008)","journal-title":"SIAM J. Optim."},{"key":"1065_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization. Applied Optimization","author":"Yu Nesterov","year":"2004","unstructured":"Nesterov, Yu.: Introductory Lectures on Convex Optimization. Applied Optimization. Kluwer Academic Publishers, Dordrecht (2004)"},{"issue":"3","key":"1065_CR15","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1080\/08927020600643812","volume":"22","author":"Yu Nesterov","year":"2007","unstructured":"Nesterov, Yu.: Modified Gauss\u2013Newton scheme with worst-case guarantees for global performance. Optim. Methods Softw. 22(3), 469\u2013483 (2007)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"1065_CR16","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","volume":"108","author":"Yu Nesterov","year":"2006","unstructured":"Nesterov, Yu., Polyak, B.T.: Cubic regularization of Newton method and its global performance. Math. Progr. Ser. A 108(1), 177\u2013205 (2006)","journal-title":"Math. Progr. Ser. A"},{"issue":"1","key":"1065_CR17","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/0803004","volume":"3","author":"SA Vavasis","year":"1993","unstructured":"Vavasis, S.A.: Black-box complexity of local minimization. SIAM J. Optim. 3(1), 60\u201380 (1993)","journal-title":"SIAM J. Optim."},{"key":"1065_CR18","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s13675-012-0003-7","volume":"1","author":"LN Vicente","year":"2013","unstructured":"Vicente, L.N.: Worst case complexity of direct search. EURO J. Comput. Optim. 1, 143\u2013153 (2013)","journal-title":"EURO J. Comput. Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1065-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-016-1065-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1065-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1065-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T22:04:51Z","timestamp":1568325891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-016-1065-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,30]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["1065"],"URL":"https:\/\/doi.org\/10.1007\/s10107-016-1065-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,30]]}}}