{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T16:47:12Z","timestamp":1779900432738,"version":"3.53.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T00:00:00Z","timestamp":1548892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T00:00:00Z","timestamp":1548892800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2013\/03447-6"],"award-info":[{"award-number":["2013\/03447-6"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2013\/05475-7"],"award-info":[{"award-number":["2013\/05475-7"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2013\/07375-0"],"award-info":[{"award-number":["2013\/07375-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2013\/23494-9"],"award-info":[{"award-number":["2013\/23494-9"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2016\/01860-1"],"award-info":[{"award-number":["2016\/01860-1"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2017\/03504-0"],"award-info":[{"award-number":["2017\/03504-0"]}],"id":[{"id":"10.13039\/501100001807","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":["309517\/2014-1"],"award-info":[{"award-number":["309517\/2014-1"]}],"id":[{"id":"10.13039\/501100003593","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":["303750\/2014-6"],"award-info":[{"award-number":["303750\/2014-6"]}],"id":[{"id":"10.13039\/501100003593","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":["302915\/2016-8"],"award-info":[{"award-number":["302915\/2016-8"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s11590-019-01395-z","type":"journal-article","created":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T09:43:30Z","timestamp":1548927810000},"page":"815-838","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["On the use of third-order models with fourth-order regularization for unconstrained optimization"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7466-7663","authenticated-orcid":false,"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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6250-0137","authenticated-orcid":false,"given":"S. A.","family":"Santos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,1,31]]},"reference":[{"issue":"1","key":"1395_CR1","first-page":"5","volume":"111","author":"R Andreani","year":"2008","unstructured":"Andreani, R., Birgin, E.G., Mart\u00ednez, J.M., Schuverdt, M.L.: Augmented Lagrangian methods under the constant positive linear dependence constraint qualification. Math. Program. 111(1), 5\u201332 (2008)","journal-title":"Math. Program."},{"issue":"3","key":"1395_CR2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1080\/02331930500100270","volume":"54","author":"M Andretta","year":"2005","unstructured":"Andretta, M., Birgin, E.G., Mart\u00ednez, J.M.: Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization. Optimization 54(3), 305\u2013325 (2005)","journal-title":"Optimization"},{"issue":"3","key":"1395_CR3","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1145\/192115.192128","volume":"20","author":"VZ Averbukh","year":"1994","unstructured":"Averbukh, V.Z., Figueroa, S., Schlick, T.: Remark on algorithm 566. ACM Trans. Math. Softw. 20(3), 282\u2013285 (1994)","journal-title":"ACM Trans. Math. Softw."},{"key":"1395_CR4","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont, Massachussets (1999)","edition":"2"},{"key":"1395_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cam.2014.12.031","volume":"282","author":"EG Birgin","year":"2015","unstructured":"Birgin, E.G., Bueno, L.F., Mart\u00ednez, J.M.: Assessing the reliability of general-purpose inexact restoration methods. J. Comput. Appl. Math. 282, 1\u201316 (2015)","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"1395_CR6","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1007\/s10589-016-9849-6","volume":"65","author":"EG Birgin","year":"2016","unstructured":"Birgin, E.G., Bueno, L.F., Mart\u00ednez, J.M.: Sequential equality-constrained optimization for nonlinear programming. Comput. Optim. Appl. 65(3), 699\u2013721 (2016)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1395_CR7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s10589-005-1066-7","volume":"31","author":"EG Birgin","year":"2005","unstructured":"Birgin, E.G., Castillo, R.A., Mart\u00ednez, J.M.: Numerical comparison of augmented Lagrangian algorithms for nonconvex problems. Comput. Optim. Appl. 31(1), 31\u201355 (2005)","journal-title":"Comput. Optim. Appl."},{"key":"1395_CR8","unstructured":"Birgin, E.G., Gardenghi, J.L., Mart\u00ednez, J.M., Santos, S.A.: Third-order derivatives of the Mor\u00e9, Garbow, and Hillstrom test set problems. Technical Report MCDO010418, University of S\u00e3o Paulo (2018). \nhttp:\/\/www.ime.usp.br\/~egbirgin\/"},{"issue":"1","key":"1395_CR9","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s10107-016-1065-8","volume":"163","author":"EG Birgin","year":"2017","unstructured":"Birgin, E.G., Gardenghi, J.L., Mart\u00ednez, J.M., Santos, S.A., Toint, P.L.: Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Math. Program. 163(1), 359\u2013368 (2017)","journal-title":"Math. Program."},{"issue":"7","key":"1395_CR10","doi-asserted-by":"crossref","first-page":"1318","DOI":"10.1016\/j.cor.2009.09.017","volume":"37","author":"EG Birgin","year":"2010","unstructured":"Birgin, E.G., Gentil, J.M.: New and improved results for packing identical unitary radius circles within triangles, rectangles and strips. Comput. Oper. Res. 37(7), 1318\u20131327 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"1395_CR11","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10589-012-9466-y","volume":"53","author":"EG Birgin","year":"2012","unstructured":"Birgin, E.G., Gentil, J.M.: Evaluating bound-constrained minimization software. Comput. Optim. Appl. 53(2), 347\u2013373 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"1395_CR12","first-page":"49","volume":"15","author":"EG Birgin","year":"2001","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: A box-constrained optimization algorithm with negative curvature directions and spectral projected gradients. Computing [Suppl] 15, 49\u201360 (2001)","journal-title":"Computing [Suppl]"},{"issue":"1","key":"1395_CR13","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1023\/A:1019928808826","volume":"23","author":"EG Birgin","year":"2002","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: Large-scale active-set box-constrained optimization method with spectral projected gradients. Comput. Optim. Appl. 23(1), 101\u2013125 (2002)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1395_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10589-007-9050-z","volume":"39","author":"EG Birgin","year":"2008","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization. Comput. Optim. Appl. 39(1), 1\u201316 (2008)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"1395_CR15","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1007\/s10589-011-9396-0","volume":"51","author":"EG Birgin","year":"2012","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization. Comput. Optim. Appl. 51(3), 941\u2013965 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"1395_CR16","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611973365","volume-title":"Practical Augmented Lagrangian Methods for Constrained Otimization, Fundamentals of Algorithms","author":"EG Birgin","year":"2014","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: Practical Augmented Lagrangian Methods for Constrained Otimization, Fundamentals of Algorithms, vol. 10. SIAM, Philadelphia, PA (2014)"},{"issue":"2","key":"1395_CR17","doi-asserted-by":"crossref","first-page":"1049","DOI":"10.1137\/16M110280X","volume":"27","author":"EG Birgin","year":"2017","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: The use of quadratic regularization with a cubic descent condition for unconstrained optimization. SIAM J. Optim. 27(2), 1049\u20131074 (2017)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1395_CR18","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.ejor.2003.06.018","volume":"160","author":"EG Birgin","year":"2005","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Ronconi, D.P.: Optimizing the packing of cylinders into a rectangular container: a nonlinear approach. Eur. J. Oper. Res. 160(1), 19\u201333 (2005)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"1395_CR19","doi-asserted-by":"crossref","first-page":"2357","DOI":"10.1016\/j.cor.2006.11.002","volume":"35","author":"EG Birgin","year":"2008","unstructured":"Birgin, E.G., Sobral, F.N.C.: Minimizing the object dimensions in circle and sphere packing problems. Comput. Oper. Res. 35(7), 2357\u20132375 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"1395_CR20","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, P.L.: On the complexity of steepest descent, Newton\u2019s and regularized Newton\u2019s methods for nonconvex unconstrained optimization problems. SIAM J. Optim. 20(6), 2833\u20132852 (2010)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1395_CR21","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, P.L.: Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math. Program. 127(2), 245\u2013295 (2011)","journal-title":"Math. Program."},{"issue":"2","key":"1395_CR22","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, P.L.: Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity. Math. Program. 130(2), 295\u2013319 (2011)","journal-title":"Math. Program."},{"issue":"1","key":"1395_CR23","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1080\/10556788.2016.1208749","volume":"32","author":"FE Curtis","year":"2017","unstructured":"Curtis, F.E., Mitchell, T., Overton, M.L.: A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles. Optim. Methods Softw. 32(1), 148\u2013181 (2017)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"1395_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-016-1026-2","volume":"162","author":"FE Curtis","year":"2017","unstructured":"Curtis, F.E., Robinson, D.P., Samadi, M.: A trust region algorithm with a worst-case iteration complexity of $$\\cal{O}(\\epsilon ^{-3\/2})$$ for nonconvex optimization. Math. Program. 162(1), 1\u201332 (2017)","journal-title":"Math. Program."},{"issue":"2","key":"1395_CR25","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"2","key":"1395_CR26","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1080\/10556788.2017.1322080","volume":"33","author":"JP Dussault","year":"2018","unstructured":"Dussault, J.P.: ARCq: a new adaptive regularization by cubics. Optim. Methods Softw. 33(2), 322\u2013335 (2018)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"1395_CR27","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. Program. 152(1), 491\u2013520 (2015)","journal-title":"Math. Program."},{"key":"1395_CR28","unstructured":"Griewank, A.: The modification of Newton\u2019s method for unconstrained optimization by bounding cubic terms. Technical Report. NA\/12, Department of Applied Mathematics and Theoretical Physics, University of Cambridge, Cambridge, England (1981)"},{"issue":"2","key":"1395_CR29","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10898-016-0475-8","volume":"68","author":"JM Mart\u00ednez","year":"2017","unstructured":"Mart\u00ednez, J.M., Raydan, M.: Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization. J. Glob. Optim. 68(2), 367\u2013385 (2017)","journal-title":"J. Glob. Optim."},{"issue":"13","key":"1395_CR30","doi-asserted-by":"crossref","first-page":"2157","DOI":"10.1002\/jcc.21224","volume":"30","author":"L Mart\u00ednez","year":"2009","unstructured":"Mart\u00ednez, L., Andrade, R., Birgin, E.G., Mart\u00ednez, J.M.: PACKMOL: a package for building initial configurations for molecular dynamics simulations. J. Comput. Chem. 30(13), 2157\u20132164 (2009)","journal-title":"J. Comput. Chem."},{"key":"1395_CR31","unstructured":"Mitchell, T.: Robust and efficient methods for approximation and optimization of stability measures. Ph.D. thesis, Department of Computer Science, New York University, New York (2014)"},{"issue":"1","key":"1395_CR32","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"JJ Mor\u00e9","year":"1981","unstructured":"Mor\u00e9, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7(1), 17\u201341 (1981)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"1395_CR33","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","volume":"108","author":"Y Nesterov","year":"2006","unstructured":"Nesterov, Y., Polyak, B.T.: Cubic regularization of Newton method and its global performance. Math. Program. 108(1), 177\u2013205 (2006)","journal-title":"Math. Program."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-019-01395-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-019-01395-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-019-01395-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,23]],"date-time":"2020-05-23T12:07:25Z","timestamp":1590235645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-019-01395-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,31]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["1395"],"URL":"https:\/\/doi.org\/10.1007\/s11590-019-01395-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,31]]},"assertion":[{"value":"7 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}