{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T05:48:01Z","timestamp":1771307281306,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T00:00:00Z","timestamp":1550188800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/M025179\/1"],"award-info":[{"award-number":["EP\/M025179\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10589-019-00064-2","type":"journal-article","created":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T10:17:16Z","timestamp":1550225836000},"page":"1-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems"],"prefix":"10.1007","volume":"73","author":[{"given":"Nicholas I. M.","family":"Gould","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0476-2259","authenticated-orcid":false,"given":"Tyrone","family":"Rees","sequence":"additional","affiliation":[]},{"given":"Jennifer A.","family":"Scott","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,15]]},"reference":[{"issue":"1","key":"64_CR1","doi-asserted-by":"publisher","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, PhL: Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Math. Program. 163(1), 359\u2013368 (2017)","journal-title":"Math. Program."},{"key":"64_CR2","unstructured":"Birgin, E.G., Martinez, J.M.: Quadratic regularization with cubic descent for unconstrained optimization. Technical Report MCDO271016, State University of Campinas, Brazil (2016)"},{"key":"64_CR3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971484","volume-title":"Numerical Methods for Least Squares Problems","author":"\u00c5 Bj\u00f6rck","year":"1996","unstructured":"Bj\u00f6rck, \u00c5.: Numerical Methods for Least Squares Problems. SIAM, Philadelphia (1996)"},{"issue":"2","key":"64_CR4","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1145\/264029.264032","volume":"23","author":"A Bouaricha","year":"1997","unstructured":"Bouaricha, A., Schnabel, R.B.: Algorithm 768: TENSOLVE: a software package for solving systems of nonlinear equations and nonlinear least-squares problems. ACM Trans. Math. Softw. 23(2), 174\u2013195 (1997)","journal-title":"ACM Trans. Math. Softw."},{"issue":"4","key":"64_CR5","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1137\/S1064827596297549","volume":"21","author":"A Bouaricha","year":"1999","unstructured":"Bouaricha, A., Schnabel, R.B.: Tensor methods for large, sparse nonlinear least squares problems. SIAM J. Sci. Stat. Comput. 21(4), 1199\u20131221 (1999)","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"6","key":"64_CR6","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, PhL: On the complexity of steepest descent, Newton\u2019s method 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":"64_CR7","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, PhL: Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math. Program. Ser. A 127(2), 245\u2013295 (2011)","journal-title":"Math. Program. Ser. A"},{"issue":"2","key":"64_CR8","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. Ser. A 130(2), 295\u2013319 (2011)","journal-title":"Math. Program. Ser. A"},{"issue":"3","key":"64_CR9","doi-asserted-by":"publisher","first-page":"1553","DOI":"10.1137\/120869687","volume":"23","author":"C Cartis","year":"2013","unstructured":"Cartis, C., Gould, N.I.M., Toint, PhL: On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization. SIAM J. Optim. 23(3), 1553\u20131574 (2013)","journal-title":"SIAM J. Optim."},{"key":"64_CR10","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models. Report naXys-11-2015(R1), University of Namur, Belgium (2015)"},{"key":"64_CR11","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Improved worst-case evaluation complexity for potentially rank-deficient nonlinear least-Euclidean-norm problems using higher-order regularized models. Technical Report RAL-TR-2015-011, Rutherford Appleton Laboratory, Chilton, Oxfordshire (2015)"},{"key":"64_CR12","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Universal regularization methods-varying the power, the smoothness and the accuracy. Preprint RAL-P-2016-010, Rutherford Appleton Laboratory, Chilton, Oxfordshire (2016)"},{"issue":"4","key":"64_CR13","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1137\/100799988","volume":"49","author":"P Chen","year":"2011","unstructured":"Chen, P.: Hessian matrix vs. Gauss\u2013Newton Hessian matrix. SIAM J. Numer. Anal. 49(4), 1417\u20131435 (2011)","journal-title":"SIAM J. Numer. Anal."},{"key":"64_CR14","unstructured":"Curtis, F.E., Lubberts, Z., Robinson, D.P.: Concise complexity analyses for trust-region methods. Technical Report 01-2018, Johns Hopkins University, Baltimore (2018)"},{"issue":"1\u20132","key":"64_CR15","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                    \n                      \n                    \n                    $$O(\\epsilon ^{-3\/2})$$\n                    \n                      \n                        \n                          O\n                          (\n                          \n                            \u03f5\n                            \n                              -\n                              3\n                              \/\n                              2\n                            \n                          \n                          )\n                        \n                      \n                    \n                   for nonconvex optimization. Math. Program. 162(1\u20132), 1\u201332 (2017)","journal-title":"Math. Program."},{"issue":"3","key":"64_CR16","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1145\/355958.355965","volume":"7","author":"JE Dennis","year":"1981","unstructured":"Dennis, J.E., Gay, D.M., Welsh, R.E.: An adaptive nonlinear least squares algorithm. ACM Trans. Math. Softw. 7(3), 348\u2013368 (1981)","journal-title":"ACM Trans. Math. Softw."},{"issue":"5","key":"64_CR17","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1137\/0715063","volume":"15","author":"PE Gill","year":"1978","unstructured":"Gill, P.E., Murray, W.: Algorithms for the solution of the nonlinear least squares problem. SIAM J. Numer. Anal. 15(5), 977\u2013992 (1978)","journal-title":"SIAM J. Numer. Anal."},{"issue":"4","key":"64_CR18","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1145\/962437.962438","volume":"29","author":"NIM Gould","year":"2003","unstructured":"Gould, N.I.M., Orban, D., Toint, PhL: GALAHAD\u2014a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization. ACM Trans. Math. Softw. 29(4), 353\u2013372 (2003)","journal-title":"ACM Trans. Math. Softw."},{"key":"64_CR19","unstructured":"Gould, N.I.M., Rees, T., Scott, J.A.: A higher order method for solving nonlinear least-squares problems. Technical Report RAL-P-2017-010, STFC Rutherford Appleton Laboratory (2017)"},{"issue":"1","key":"64_CR20","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1137\/16M1087801","volume":"27","author":"GN Grapiglia","year":"2017","unstructured":"Grapiglia, G.N., Nesterov, Y.: Regularized Newton methods for minimizing functions with H\u00f6lder continuous Hessians. SIAM J. Optim. 27(1), 478\u2013506 (2017)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"64_CR21","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1090\/qam\/10666","volume":"2","author":"K Levenberg","year":"1944","unstructured":"Levenberg, K.: A method for the solution of certain problems in least squares. Q. Appl. Math. 2(2), 164\u2013168 (1944)","journal-title":"Q. Appl. Math."},{"issue":"2","key":"64_CR22","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/0111030","volume":"11","author":"D Marquardt","year":"1963","unstructured":"Marquardt, D.: An algorithm for least-squares estimation of nonlinear parameters. SIAM J. Appl. Math. 11(2), 431\u2013441 (1963)","journal-title":"SIAM J. Appl. Math."},{"key":"64_CR23","first-page":"105","volume-title":"Numerical Analysis, Dundee 1977, Number 630 in Lecture Notes in Mathematics","author":"JJ Mor\u00e9","year":"1978","unstructured":"Mor\u00e9, J.J.: The Levenberg-Marquardt algorithm: implementation and theory. In: Watson, G.A. (ed.) Numerical Analysis, Dundee 1977, Number 630 in Lecture Notes in Mathematics, pp. 105\u2013116. Springer, Berlin (1978)"},{"key":"64_CR24","unstructured":"Morrison, D.D.: Methods for nonlinear least squares problems and convergence proofs. In: Lorell, J., Yagi, F (eds.) Proceedings of the Seminar on Tracking Programs and Orbit Determination, pp. 1\u20139, Pasadena. Jet Propulsion Laboratory (1960)"},{"key":"64_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization","author":"Yu Nesterov","year":"2004","unstructured":"Nesterov, Yu.: Introductory Lectures on Convex Optimization. Kluwer Academic Publishers, Dordrecht (2004)"},{"issue":"1","key":"64_CR26","doi-asserted-by":"publisher","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. Program. 108(1), 177\u2013205 (2006)","journal-title":"Math. Program."},{"key":"64_CR27","unstructured":"NIST Nonlinear Regression Datasets. \n                    http:\/\/www.itl.nist.gov\/div898\/strd\/nls\/nls_main.shtml\n                    \n                  . Accessed June 2018"},{"key":"64_CR28","unstructured":"RALFit. \n                    https:\/\/github.com\/ralna\/RALFit\n                    \n                  . Accessed 20 July 2018"},{"issue":"6","key":"64_CR29","doi-asserted-by":"publisher","first-page":"060201","DOI":"10.1103\/PhysRevLett.104.060201","volume":"104","author":"MK Transtrum","year":"2010","unstructured":"Transtrum, M.K., Machta, B.B., Sethna, J.P.: Why are nonlinear fits to data so challenging? Phys. Rev. Lett. 104(6), 060201 (2010)","journal-title":"Phys. Rev. Lett."},{"key":"64_CR30","unstructured":"Transtrum, M.K., Sethna, J.P.: Geodesic acceleration and the small-curvature approximation for nonlinear least squares (2012). \n                    arXiV.1207.4999"},{"issue":"2","key":"64_CR31","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s10589-010-9367-x","volume":"51","author":"H Zhang","year":"2012","unstructured":"Zhang, H., Conn, A.R.: On the local convergence of a derivative-free algorithm for least-squares minimization. Comput. Optim. Appl. 51(2), 481\u2013507 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"6","key":"64_CR32","doi-asserted-by":"publisher","first-page":"3555","DOI":"10.1137\/09075531X","volume":"20","author":"H Zhang","year":"2010","unstructured":"Zhang, H., Conn, A.R., Scheinberg, K.: A derivative-free algorithm for least-squares minimization. SIAM J. Optim. 20(6), 3555\u20133576 (2010)","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00064-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00064-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00064-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,14]],"date-time":"2020-02-14T19:14:18Z","timestamp":1581707658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00064-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,15]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["64"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00064-2","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,15]]},"assertion":[{"value":"27 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}