{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T11:05:31Z","timestamp":1769511931579,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,9,8]],"date-time":"2016-09-08T00:00:00Z","timestamp":1473292800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s10957-016-1007-x","type":"journal-article","created":{"date-parts":[[2016,9,8]],"date-time":"2016-09-08T12:44:07Z","timestamp":1473338647000},"page":"980-997","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Nonlinear Stepsize Control Algorithms: Complexity Bounds for First- and Second-Order Optimality"],"prefix":"10.1007","volume":"171","author":[{"given":"Geovani Nunes","family":"Grapiglia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinyun","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ya-xiang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,8]]},"reference":[{"key":"1007_CR1","doi-asserted-by":"crossref","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":"1007_CR2","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1093\/imanum\/8.2.231","volume":"8","author":"PhL Toint","year":"1988","unstructured":"Toint, PhL: Global convergence of a class of trust region methods for nonconvex minimization in Hilbert space. IMA J. Numer. Anal. 8, 231\u2013252 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"1007_CR3","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1080\/10556788.2011.610458","volume":"28","author":"PhL Toint","year":"2013","unstructured":"Toint, PhL: Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization. Optim. Methods Softw. 28, 82\u201395 (2013)","journal-title":"Optim. Methods Softw."},{"key":"1007_CR4","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-Region Methods","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, PhL: Trust-Region Methods. SIAM, Philadelphia (2000)"},{"key":"1007_CR5","volume-title":"Nonlinear Programming 2","author":"MJD Powell","year":"1975","unstructured":"Powell, M.J.D.: Convergence properties of a class of minimization algorithms. In: Mangasarian, O.L., Meyer, R.R., Robinson, S.M. (eds.) Nonlinear Programming 2. Academic Press, New York (1975)"},{"key":"1007_CR6","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, PhL: Adaptive cubic overestimation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math. Program. 127, 245\u2013295 (2011)","journal-title":"Math. Program."},{"key":"1007_CR7","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, 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":"1007_CR8","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1080\/08927020600643812","volume":"22","author":"Yu Nesterov","year":"2007","unstructured":"Nesterov, Yu.: Modified Gauss\u2013Newton scheme with worst-case guarantees for global performance. Optim. Methods Softw. 22, 469\u2013483 (2007)","journal-title":"Optim. Methods Softw."},{"key":"1007_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/080732432","volume":"48","author":"S Bellavia","year":"2010","unstructured":"Bellavia, S., Cartis, C., Gould, N.I.M., Morini, B., Toint, PhL: Convergence of a regularized euclidean residual algorithm for nonlinear least-squares. SIAM J. Numer. Anal. 48, 1\u201329 (2010)","journal-title":"SIAM J. Numer. Anal."},{"key":"1007_CR10","unstructured":"Fan, J., Yuan, Y.: A new trust region algorithm with trust region radius converging to zero. In: Li, D. (ed.) Proceeding of the 5th International Conference on Optimization: Techiniques and Applications, pp. 786\u2013794. Hong Kong (2001)"},{"key":"1007_CR11","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s001860300302","volume":"58","author":"J Zhang","year":"2003","unstructured":"Zhang, J., Wang, Y.: A new trust region method for nonlinear equations. Math. Methods Oper. Res. 58, 283\u2013298 (2003)","journal-title":"Math. Methods Oper. Res."},{"key":"1007_CR12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s10589-005-3078-8","volume":"34","author":"J Fan","year":"2006","unstructured":"Fan, J.: Convergence rate of the trust region method for nonlinear equations under local error bound condition. Comput. Optim. Appl. 34, 215\u2013227 (2006)","journal-title":"Comput. Optim. Appl."},{"key":"1007_CR13","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/j.amc.2008.06.062","volume":"204","author":"X Lu","year":"2008","unstructured":"Lu, X., Ni, Q.: A quasi-Newton trust-region method with a new conic model for the unconstrained optimization. Appl. Math. Comput. 204, 373\u2013384 (2008)","journal-title":"Appl. Math. Comput."},{"key":"1007_CR14","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1080\/10556788.2015.1130129","volume":"31","author":"GN Grapiglia","year":"2016","unstructured":"Grapiglia, G.N., Yuan, J., Yuan, Y.: On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization. Optim. Methods Softw. 31, 591\u2013604 (2016)","journal-title":"Optim. Methods Softw."},{"key":"1007_CR15","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, 491\u2013520 (2015)","journal-title":"Math. Program."},{"key":"1007_CR16","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF02591998","volume":"29","author":"MJD Powell","year":"1984","unstructured":"Powell, M.J.D.: On the global convergence of trust region algorithms for unconstrained minimization. Math. Program. 29, 297\u2013303 (1984)","journal-title":"Math. Program."},{"key":"1007_CR17","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using H\u00f6lder continuous gradients. Technical Report NA-14-21, Mathematical Institute, University of Oxford (2014)"},{"key":"1007_CR18","doi-asserted-by":"crossref","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."},{"key":"1007_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization. Applied Optimization","author":"Yu Nesterov","year":"2004","unstructured":"Nesterov, Yu.: Introductory Lectures on Convex Optimization. Applied Optimization. Kluwer, Dordrecht (2004)"},{"key":"1007_CR20","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1137\/050623012","volume":"19","author":"S Gratton","year":"2008","unstructured":"Gratton, S., Sartenaer, A., Toint, Ph L.: Recursive trust-region methods for multiscale nonlinear optimization. SIAM J. Optim. 19, 414\u2013444 (2008)","journal-title":"SIAM J. Optim."},{"key":"1007_CR21","doi-asserted-by":"crossref","first-page":"1349","DOI":"10.1080\/02331934.2013.869809","volume":"64","author":"C Cartis","year":"2015","unstructured":"Cartis, C., Sampaio, PhR, Toint, PhL: Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization. Optimization 64, 1349\u20131361 (2015)","journal-title":"Optimization"},{"key":"1007_CR22","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s10957-010-9731-0","volume":"147","author":"K Ueda","year":"2010","unstructured":"Ueda, K., Yamashita, N.: On a global complexity bound of the Levenberg\u2013Marquardt method. J. Optim. Theory Appl. 147, 443\u2013453 (2010)","journal-title":"J. Optim. Theory Appl."},{"key":"1007_CR23","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. 108, 177\u2013205 (2006)","journal-title":"Math. Program."},{"key":"1007_CR24","doi-asserted-by":"publisher","unstructured":"Curtis, F.E., Robinson, D.P., Samadi, M.: A trust region algorithm with a worst-case iteration complexity of $$O(\\epsilon ^{-3\/2})$$ O ( \u03f5 - 3 \/ 2 ) for nonconvex optimization. Math. Program. doi: 10.1007\/s10107-016-1026-2","DOI":"10.1007\/s10107-016-1026-2"},{"key":"1007_CR25","unstructured":"Mart\u00ednez, J.M., Raydan, M.: Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization (2015). http:\/\/www.optimization-online.org\/DB_FILE\/2015\/11\/5203.pdf"},{"key":"1007_CR26","unstructured":"Birgin, E.G., Gardenghi, J.L., Mart\u00ednez, J.M., Toint, Ph.L.: Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Technical Report naXys-05-2015, Namur Center for Complex Systems (naXys), University of Namur, Namur, Belgium (2015)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-016-1007-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-016-1007-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-016-1007-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T18:15:08Z","timestamp":1498328108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-016-1007-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,8]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["1007"],"URL":"https:\/\/doi.org\/10.1007\/s10957-016-1007-x","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,8]]}}}