{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:42:34Z","timestamp":1757313754600,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,9,10]],"date-time":"2018-09-10T00:00:00Z","timestamp":1536537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Universite Toulouse III Paul Sabatier","award":["Doctoral grant"],"award-info":[{"award-number":["Doctoral grant"]}]},{"name":"FCT","award":["UID\/MAT\/00324\/2013","P2020 SAICT- PAC\/0011\/2015"],"award-info":[{"award-number":["UID\/MAT\/00324\/2013","P2020 SAICT- PAC\/0011\/2015"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s10107-018-1328-7","type":"journal-article","created":{"date-parts":[[2018,9,9]],"date-time":"2018-09-09T22:42:36Z","timestamp":1536532956000},"page":"195-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A decoupled first\/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds"],"prefix":"10.1007","volume":"179","author":[{"given":"S.","family":"Gratton","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2452-2172","authenticated-orcid":false,"given":"C. W.","family":"Royer","sequence":"additional","affiliation":[]},{"given":"L. N.","family":"Vicente","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,10]]},"reference":[{"key":"1328_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, N., Allen-Zhu, Z., Bullins, B., Hazan, E., Ma, T.: Finding approximate local minima faster than gradient descent. \narXiv:1611.01146v4\n\n (2017)","DOI":"10.1145\/3055399.3055464"},{"key":"1328_CR2","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10107-009-0305-6","volume":"128","author":"CP Avelino","year":"2011","unstructured":"Avelino, C.P., Moguerza, J.M., Olivares, A., Prieto, F.J.: Combining and scaling descent and negative curvature directions. Math. Program. 128, 285\u2013319 (2011)","journal-title":"Math. Program."},{"key":"1328_CR3","doi-asserted-by":"publisher","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, 1049\u20131074 (2017)","journal-title":"SIAM J. Optim."},{"key":"1328_CR4","doi-asserted-by":"crossref","unstructured":"Carmon, Y., Duchi, J.C., Hinder, O., Sidford, A.: Accelerated methods for non-convex optimization. \narXiv:1611.00756v2\n\n (2017)","DOI":"10.1137\/17M1114296"},{"key":"1328_CR5","doi-asserted-by":"publisher","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 regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity. Math. Program. 130, 295\u2013319 (2011)","journal-title":"Math. Program."},{"key":"1328_CR6","doi-asserted-by":"publisher","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":"5","key":"1328_CR7","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1007\/s10208-017-9363-y","volume":"18","author":"Coralia Cartis","year":"2017","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Second-order optimality and beyond: characterization and evaluation complexity in convexly-constrained nonlinear optimization. Found. Comput. Math. (2017). \nhttps:\/\/doi.org\/10.1007\/s10208-017-9363-y","journal-title":"Foundations of Computational Mathematics"},{"key":"1328_CR8","volume-title":"Trust-Region Methods. MPS-SIAM Series on Optimization","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, PhL: Trust-Region Methods. MPS-SIAM Series on Optimization. SIAM, Philadelphia (2000)"},{"key":"1328_CR9","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1093\/imanum\/drn046","volume":"28","author":"AR Conn","year":"2008","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation. IMA J. Numer. Anal. 28, 721\u2013748 (2008)","journal-title":"IMA J. Numer. Anal."},{"key":"1328_CR10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to Derivative-Free Optimization. MPS-SIAM Series on Optimization","author":"AR Conn","year":"2009","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to Derivative-Free Optimization. MPS-SIAM Series on Optimization. SIAM, Philadelphia (2009)"},{"key":"1328_CR11","doi-asserted-by":"publisher","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 \n$${\\cal{O}}(\\epsilon ^{-3\/2})$$\n\n\n\n\nO\n(\n\n\u03f5\n\n-\n3\n\/\n2\n\n\n)\n\n\n\n\n for nonconvex optimization. Math. Program. 162, 1\u201332 (2017)","journal-title":"Math. Program."},{"key":"1328_CR12","doi-asserted-by":"publisher","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, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"1328_CR13","unstructured":"Fan, J., Yuan, Y.: A new trust region algorithm with trust region radius converging to zero. In: Proceedings of the 5th International Conference on Optimization: Techniques and Applications, Hong Kong (2001)"},{"key":"1328_CR14","doi-asserted-by":"publisher","first-page":"1987","DOI":"10.1137\/151005683","volume":"26","author":"R Garmanjani","year":"2016","unstructured":"Garmanjani, R., J\u00fadice, D., Vicente, L.N.: Trust-region methods without using derivatives: worst case complexity and the non-smooth case. SIAM J. Optim. 26, 1987\u20132011 (2016)","journal-title":"SIAM J. Optim."},{"key":"1328_CR15","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1080\/10556780008805794","volume":"14","author":"NIM Gould","year":"2000","unstructured":"Gould, N.I.M., Lucidi, S., Roma, M., Toint, PhL: Exploiting negative curvature directions in linesearch methods for unconstrained optimization. Optim. Methods Softw. 14, 75\u201398 (2000)","journal-title":"Optim. Methods Softw."},{"key":"1328_CR16","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NIM Gould","year":"2015","unstructured":"Gould, N.I.M., Orban, D., Toint, PhL: CUTEst: a constrained and unconstrained testing environment with safe threads. Comput. Optim. Appl. 60, 545\u2013557 (2015)","journal-title":"Comput. Optim. Appl."},{"key":"1328_CR17","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1007\/s10957-016-1007-x","volume":"171","author":"GN Grapiglia","year":"2016","unstructured":"Grapiglia, G.N., Yuan, J., Yuan, Y.-X.: Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality. J. Optim. Theory Appl. 171, 980\u2013997 (2016)","journal-title":"J. Optim. Theory Appl."},{"key":"1328_CR18","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1080\/02331934.2015.1124271","volume":"65","author":"S Gratton","year":"2016","unstructured":"Gratton, S., Royer, C.W., Vicente, L.N.: A second-order globally convergent direct-search method and its worst-case complexity. Optimization 65, 1105\u20131128 (2016)","journal-title":"Optimization"},{"key":"1328_CR19","unstructured":"J\u00fadice, D.: Trust-region methods without using derivatives: worst case complexity and the non-smooth case. PhD thesis, Department of Mathematics, University of Coimbra (2015)"},{"key":"1328_CR20","doi-asserted-by":"publisher","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, 367\u2013385 (2017)","journal-title":"J. Glob. Optim."},{"key":"1328_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01582091","volume":"16","author":"JJ Mor\u00e9","year":"1979","unstructured":"Mor\u00e9, J.J., Sorensen, D.C.: On the use of directions of negative curvature in a modified Newton method. Math. Program. 16, 1\u201320 (1979)","journal-title":"Math. Program."},{"key":"1328_CR22","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/080724083","volume":"20","author":"JJ Mor\u00e9","year":"2009","unstructured":"Mor\u00e9, J.J., Wild, S.M.: Benchmarking derivative-free optimization algorithms. SIAM J. Optim. 20, 172\u2013191 (2009)","journal-title":"SIAM J. Optim."},{"key":"1328_CR23","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1016\/j.ejor.2006.09.097","volume":"189","author":"A Olivares","year":"2008","unstructured":"Olivares, A., Moguerza, J.M., Prieto, F.J.: Nonconvex optimization using negative curvature within a modified linesearch. Eur. J. Oper. Res. 189, 706\u2013722 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"1328_CR24","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1137\/0722003","volume":"22","author":"GA Shultz","year":"1985","unstructured":"Shultz, G.A., Schnabel, R.B., Byrd, R.H.: A family of trust-region-based algorithms for unconstrained minimization with strong global convergence properties. SIAM J. Numer. Anal. 22, 47\u201367 (1985)","journal-title":"SIAM J. Numer. Anal."},{"key":"1328_CR25","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1137\/0719026","volume":"19","author":"DC Sorensen","year":"1983","unstructured":"Sorensen, D.C.: Newton\u2019s method with a model trust region modification. SIAM J. Numer. Anal. 19, 409\u2013426 (1983)","journal-title":"SIAM J. Numer. Anal."},{"key":"1328_CR26","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10107-015-0893-2","volume":"151","author":"Y-X Yuan","year":"2015","unstructured":"Yuan, Y.-X.: Recent avances in trust region algorithms. Math. Program. 151, 249\u2013281 (2015)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1328-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1328-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1328-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T18:04:57Z","timestamp":1578679497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1328-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,10]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["1328"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1328-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2018,9,10]]},"assertion":[{"value":"23 April 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}