{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T21:55:53Z","timestamp":1778882153946,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,1,19]],"date-time":"2019-01-19T00:00:00Z","timestamp":1547856000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,1,19]],"date-time":"2019-01-19T00:00:00Z","timestamp":1547856000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1447449"],"award-info":[{"award-number":["1447449"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1628384"],"award-info":[{"award-number":["1628384"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1634597"],"award-info":[{"award-number":["1634597"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1740707"],"award-info":[{"award-number":["1740707"]}],"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-13-1-0138"],"award-info":[{"award-number":["FA9550-13-1-0138"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006224","name":"Argonne National Laboratory","doi-asserted-by":"publisher","award":["3F-30222"],"award-info":[{"award-number":["3F-30222"]}],"id":[{"id":"10.13039\/100006224","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006224","name":"Argonne National Laboratory","doi-asserted-by":"publisher","award":["8F-30039"],"award-info":[{"award-number":["8F-30039"]}],"id":[{"id":"10.13039\/100006224","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10107-019-01362-7","type":"journal-article","created":{"date-parts":[[2019,1,19]],"date-time":"2019-01-19T08:31:37Z","timestamp":1547886697000},"page":"451-488","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":45,"title":["A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization"],"prefix":"10.1007","volume":"180","author":[{"given":"Cl\u00e9ment W.","family":"Royer","sequence":"first","affiliation":[]},{"given":"Michael","family":"O\u2019Neill","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6815-7379","authenticated-orcid":false,"given":"Stephen J.","family":"Wright","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,19]]},"reference":[{"key":"1362_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. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC 2017), PMLR (2017)","DOI":"10.1145\/3055399.3055464"},{"key":"1362_CR2","unstructured":"Allen-Zhu, Z., Li, Y.: NEON2: finding local minima via first-order oracles. In: Proceedings of the 32nd Conference on Neural Information Processing Systems (2018)"},{"key":"1362_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."},{"issue":"3-4","key":"1362_CR4","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1561\/2200000050","volume":"8","author":"S\u00e9bastien Bubeck","year":"2015","unstructured":"Bubeck, S.: Convex optimization: algorithms and complexity. Found. Trends$$^{{\\copyright }}$$ Mach. Learn. 8, 231\u2013357 (2015)","journal-title":"Foundations and Trends\u00ae in Machine Learning"},{"key":"1362_CR5","unstructured":"Carmon, Y., Duchi, J.C., Hinder, O., Sidford, A.: \u201cConvex until proven guilty\u201d: dimension-free acceleration of gradient descent on non-convex functions. In: International Conference on Machine Learning, vol. 70, 6\u201311 August 2017, International Convention Centre, Sydney, Australia, PMLR, pp. 654\u2013663 (2017)"},{"key":"1362_CR6","doi-asserted-by":"publisher","first-page":"1751","DOI":"10.1137\/17M1114296","volume":"28","author":"Y Carmon","year":"2018","unstructured":"Carmon, Y., Duchi, J.C., Hinder, O., Sidford, A.: Accelerated methods for non-convex optimization. SIAM J. Optim. 28, 1751\u20131772 (2018)","journal-title":"SIAM J. Optim."},{"key":"1362_CR7","doi-asserted-by":"publisher","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. SIAM J. Optim. 20, 2833\u20132852 (2010)","journal-title":"SIAM J. Optim."},{"key":"1362_CR8","doi-asserted-by":"publisher","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, 245\u2013295 (2011)","journal-title":"Math. Program."},{"key":"1362_CR9","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: Optimal Newton-type methods for nonconvex optimization. Technical Report naXys-17-2011, Department of Mathematics, FUNDP, Namur (B) (2011)"},{"key":"1362_CR10","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, P.L.: Complexity bounds for second-order optimality in unconstrained optimization. J. Complex. 28, 93\u2013108 (2012)","journal-title":"J. Complex."},{"key":"1362_CR11","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization. \narXiv:1709.07180\n\n (2017)"},{"key":"1362_CR12","series-title":"MPS-SIAM Series on Optimization","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-Region Methods","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-Region Methods. MPS-SIAM Series on Optimization. Society for Industrial and Applied Mathematics, Philadelphia (2000)"},{"key":"1362_CR13","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 $$\\cal{O}\\left(\\epsilon ^{-3\/2}\\right)$$ for nonconvex optimization. Math. Program. 162, 1\u201332 (2017)","journal-title":"Math. Program."},{"issue":"3","key":"1362_CR14","doi-asserted-by":"publisher","first-page":"1296","DOI":"10.1093\/imanum\/dry022","volume":"39","author":"Frank E Curtis","year":"2018","unstructured":"Curtis, F.E., Robinson, D.P., Samadi, M.: An inexact regularized Newton framework with a worst-case iteration complexity of $$\\cal{O}(\\epsilon ^{-3\/2})$$ for nonconvex optimization. IMA J. Numer. Anal. (2018). \nhttps:\/\/doi.org\/10.1093\/imanum\/dry022","journal-title":"IMA Journal of Numerical Analysis"},{"key":"1362_CR15","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/BF02592055","volume":"26","author":"RS Dembo","year":"1983","unstructured":"Dembo, R.S., Steihaug, T.: Truncated-Newton algorithms for large-scale unconstrained optimization. Math. Program. 26, 190\u2013212 (1983)","journal-title":"Math. Program."},{"key":"1362_CR16","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s11590-009-0132-y","volume":"3","author":"G Fasano","year":"2009","unstructured":"Fasano, G., Lucidi, S.: A nonmonotone truncated Newton\u2013Krylov method exploiting negative curvature directions, for large-scale unconstrained optimization. Optim. Lett. 3, 521\u2013535 (2009)","journal-title":"Optim. Lett."},{"key":"1362_CR17","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, P.L.: Exploiting negative curvature directions in linesearch methods for unconstrained optimization. Optim. Methods Softw. 14, 75\u201398 (2000)","journal-title":"Optim. Methods Softw."},{"key":"1362_CR18","series-title":"Frontiers in Applied Mathematics","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717761","volume-title":"Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation","author":"A Griewank","year":"2008","unstructured":"Griewank, A., Walther, A.: Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. Frontiers in Applied Mathematics, 2nd edn. SIAM, Philadelphia (2008)","edition":"2"},{"key":"1362_CR19","unstructured":"Jin, C., Netrapalli, P., Jordan, M.I.: Accelerated gradient descent escapes saddle points faster than gradient descent. In: Proceedings of the 31st Conference on Learning Theory, PMLR, pp. 1042\u20131085 (2018)"},{"key":"1362_CR20","unstructured":"Karimi, S., Vavasis, S.A.: A unified convergence bound for conjugate gradient and accelerated gradient. \narXiv:1605.00320\n\n (2016)"},{"key":"1362_CR21","unstructured":"Karimi, S., Vavasis, S.A.: A single potential governing convergence of conjugate gradient, accelerated gradient and geometric descent. \narXiv:1712.09498\n\n (2017)"},{"key":"1362_CR22","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1137\/0613066","volume":"13","author":"J Kuczy\u0144ski","year":"1992","unstructured":"Kuczy\u0144ski, J., Wo\u017aniakowski, H.: Estimating the largest eigenvalue by the power and Lanczos algorithms with a random start. SIAM J. Matrix Anal. Appl. 13, 1094\u20131122 (1992)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1362_CR23","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":"1362_CR24","doi-asserted-by":"publisher","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, 177\u2013205 (2006)","journal-title":"Math. Program."},{"key":"1362_CR25","series-title":"Springer Series in Operations Research and Financial Engineering","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer Series in Operations Research and Financial Engineering, 2nd edn. Springer, New York (2006)","edition":"2"},{"key":"1362_CR26","doi-asserted-by":"publisher","first-page":"1448","DOI":"10.1137\/17M1134329","volume":"28","author":"CW Royer","year":"2018","unstructured":"Royer, C.W., Wright, S.J.: Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization. SIAM J. Optim. 28, 1448\u20131477 (2018)","journal-title":"SIAM J. Optim."},{"key":"1362_CR27","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1137\/0720042","volume":"20","author":"T Steihaug","year":"1983","unstructured":"Steihaug, T.: The conjugate gradient method and trust regions in large scale optimization. SIAM J. Numer. Anal. 20, 626\u2013637 (1983)","journal-title":"SIAM J. Numer. Anal."},{"key":"1362_CR28","unstructured":"Xu, Y., Jin, R., Yang, T.: First-order stochastic algorithms for escaping from saddle points in almost linear time. In: Proceedings of the 32nd Conference on Neural Information Processing Systems (2018)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-019-01362-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01362-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01362-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:30:54Z","timestamp":1589646654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-019-01362-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,19]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["1362"],"URL":"https:\/\/doi.org\/10.1007\/s10107-019-01362-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,19]]},"assertion":[{"value":"9 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}