{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T23:19:41Z","timestamp":1780096781914,"version":"3.54.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,7,21]],"date-time":"2010-07-21T00:00:00Z","timestamp":1279670400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1007\/s10957-010-9731-0","type":"journal-article","created":{"date-parts":[[2010,7,20]],"date-time":"2010-07-20T12:33:55Z","timestamp":1279629235000},"page":"443-453","source":"Crossref","is-referenced-by-count":43,"title":["On a Global Complexity Bound of\u00a0the\u00a0Levenberg-Marquardt Method"],"prefix":"10.1007","volume":"147","author":[{"given":"Kenji","family":"Ueda","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nobuo","family":"Yamashita","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,7,21]]},"reference":[{"key":"9731_CR1","volume-title":"Nonlinear Programming","author":"D.P. Bertsekas","year":"1995","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, New York (1995)"},{"key":"9731_CR2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BFb0067700","volume":"630","author":"J.J. Mor\u00e9","year":"1978","unstructured":"Mor\u00e9, J.J.: The Levenberg-Marquardt algorithm: implementation and theory. Numer. Anal. 630, 105\u2013116 (1978)","journal-title":"Numer. Anal."},{"key":"9731_CR3","volume-title":"Numerical Optimization","author":"J. Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, New York (2006)","edition":"2"},{"key":"9731_CR4","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1017\/S033427000000120X","volume":"19","author":"M.R. Osborne","year":"1976","unstructured":"Osborne, M.R.: Nonlinear least squares\u2014the Levenberg algorithm revisited. J. Aust. Math. Soc. 19, 343\u2013357 (1976)","journal-title":"J. Aust. Math. Soc."},{"key":"9731_CR5","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1017\/S0334270000004604","volume":"26","author":"S.J. Wright","year":"1985","unstructured":"Wright, S.J., Holt, J.N.: An inexact Levenberg-Marquardt method for large sparse nonlinear least squares. J. Aust. Math. Soc. 26, 387\u2013403 (1985)","journal-title":"J. Aust. Math. Soc."},{"key":"9731_CR6","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-Region Methods","author":"A.R. Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-Region Methods. SIAM, Philadelphia (2000)"},{"key":"9731_CR7","doi-asserted-by":"crossref","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: Adaptive cubic regularization methods for unconstrained optimization. Part II: Worst-case function- and derivative-evaluation complexity. Math. Program. doi: 10.1007\/s10107-009-0337-y","DOI":"10.1007\/s10107-009-0337-y"},{"key":"9731_CR8","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. Technical Report 09\/14, Department of Mathematics, FUNDP\u2014University of Namur (2009)"},{"key":"9731_CR9","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1137\/050623012","volume":"19","author":"S. Gratton","year":"2008","unstructured":"Gratton, S., Sartenaer, A., Toint, P.L.: Recursive trust-region methods for multiscale nonlinear optimization. SIAM J. Optim. 19, 414\u2013444 (2008)","journal-title":"SIAM J. Optim."},{"key":"9731_CR10","doi-asserted-by":"crossref","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, Dordrecht (2004)"},{"key":"9731_CR11","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. Program., Ser. A 108, 177\u2013205 (2006)","journal-title":"Math. Program., Ser. A"},{"key":"9731_CR12","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-007-0143-3","volume":"120","author":"R.A. Polyak","year":"2009","unstructured":"Polyak, R.A.: Regularized Newton method for unconstrained convex optimization. Math. Program., Ser. B 120, 125\u2013145 (2009)","journal-title":"Math. Program., Ser. B"},{"key":"9731_CR13","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s00245-009-9094-9","volume":"62","author":"K. Ueda","year":"2010","unstructured":"Ueda, K., Yamashita, N.: Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization. Appl. Math. Optim. 62, 27\u201346 (2010)","journal-title":"Appl. Math. Optim."},{"key":"9731_CR14","unstructured":"Ueda, K., Yamashita, N.: A regularized Newton method without line search for unconstrained optimization. Technical Report 2009-007, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University (2009)"},{"key":"9731_CR15","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1080\/08927020600643812","volume":"22","author":"Yu. Nesterov","year":"2007","unstructured":"Nesterov, Yu.: Modified Gauss-Newton scheme with worst-case guarantees for global performance. Optim. Methods Softw. 22, 469\u2013483 (2007)","journal-title":"Optim. Methods Softw."},{"key":"9731_CR16","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/978-3-7091-6217-0_17","volume":"15","author":"N. Yamashita","year":"2001","unstructured":"Yamashita, N., Fukushima, M.: On the rate of convergence of the Levenberg-Marquardt method. Comput., Suppl. (Wien) 15, 227\u2013238 (2001)","journal-title":"Comput., Suppl. (Wien)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-010-9731-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-010-9731-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-010-9731-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:55:09Z","timestamp":1559454909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-010-9731-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,21]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["9731"],"URL":"https:\/\/doi.org\/10.1007\/s10957-010-9731-0","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,21]]}}}