{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T18:11:39Z","timestamp":1785607899070,"version":"3.56.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2014,7,22]],"date-time":"2014-07-22T00:00:00Z","timestamp":1405987200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s10107-014-0794-9","type":"journal-article","created":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T19:32:26Z","timestamp":1405971146000},"page":"491-520","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":56,"title":["On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization"],"prefix":"10.1007","volume":"152","author":[{"given":"Geovani N.","family":"Grapiglia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinyun","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ya-xiang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,7,22]]},"reference":[{"key":"794_CR1","doi-asserted-by":"crossref","unstructured":"Bellavia, S., Cartis, C., Gould, N.I.M., Morini, B., Toint, Ph.L.: Convergence of a regularized euclidean residual algorithm for nonlinear least-squares. SIAM J. Numer. Anal. 48, 1\u201329 (2010)","DOI":"10.1137\/080732432"},{"key":"794_CR2","doi-asserted-by":"crossref","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math. Program. 127, 245\u2013295 (2011)","DOI":"10.1007\/s10107-009-0286-5"},{"key":"794_CR3","doi-asserted-by":"crossref","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function\u2014and derivative\u2014evaluation complexity. Math. Program. 130, 295\u2013319 (2011)","DOI":"10.1007\/s10107-009-0337-y"},{"key":"794_CR4","doi-asserted-by":"crossref","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming. SIAM J. Optim. 21, 1721\u20131739 (2011)","DOI":"10.1137\/11082381X"},{"key":"794_CR5","doi-asserted-by":"crossref","unstructured":"Conn, A.R., Gould, N.I.M., Toint, Ph.L.: Trust-Region Methods. SIAM, Philadelphia (2000)","DOI":"10.1137\/1.9780898719857"},{"key":"794_CR6","first-page":"221","volume":"21","author":"YH Dai","year":"2003","unstructured":"Dai, Y.H., Xu, D.C.: A new family of trust region algorithms for unconstrained optimization. J. Comp. Math. 21, 221\u2013228 (2003)","journal-title":"J. Comp. Math."},{"key":"794_CR7","volume-title":"Numerical Methods for Unconstrained Optimization and Nonlinear Equations","author":"JE Dennis","year":"1983","unstructured":"Dennis, J.E., Schnabel, R.B.: Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, Englewood Cliffs (1983)"},{"key":"794_CR8","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":"794_CR9","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":"794_CR10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BFb0120959","volume":"17","author":"R Fletcher","year":"1982","unstructured":"Fletcher, R.: A model algorithm for composite nondifferentiable optimization problems. Math. Program. 17, 67\u201376 (1982)","journal-title":"Math. Program."},{"key":"794_CR11","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s001860000043","volume":"51","author":"J Fliege","year":"2000","unstructured":"Fliege, J., Svaiter, B.F.: Steepest descent methods for multicriteria optimization. Math. Meth. Oper. Res. 51, 479\u2013494 (2000)","journal-title":"Math. Meth. Oper. Res."},{"key":"794_CR12","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1023\/A:1017519922669","volume":"109","author":"A Guerraggio","year":"2001","unstructured":"Guerraggio, A., Luc, D.T.: Optimality conditions for $$C^{1,1}$$ C 1 , 1 vector optimization problems. J. Optim. Theory Appl. 109, 615\u2013629 (2001)","journal-title":"J. Optim. Theory Appl."},{"key":"794_CR13","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. Methodos Softw. 22, 469\u2013483 (2007)","journal-title":"Optim. Methodos Softw."},{"key":"794_CR14","volume-title":"Nonlinear Programming, vol. 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, vol. 2. Academic Press, New York (1975)"},{"key":"794_CR15","unstructured":"Powell, M.J.D.: General Algorithms for Discrete Nonlinear Approximation Calculations. Report DAMTP 1983\/NA2, Department of Applied Mathematics and Theoretical Physics. University of Cambridge, Cambridge, England (1983)"},{"key":"794_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":"794_CR17","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":"794_CR18","unstructured":"Sun, W., Yuan, Y.: Optimization Theory and Methods: Nonlinear Programming. Springer, Berlin (2006)"},{"key":"794_CR19","doi-asserted-by":"crossref","unstructured":"Toint, Ph.L.: Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization. Optim. Methods Softw. 28, 82\u201395 (2013)","DOI":"10.1080\/10556788.2011.610458"},{"key":"794_CR20","doi-asserted-by":"crossref","unstructured":"Toint, Ph.L.: Global convergence of a class of trust region methods for nonconvex minimization in Hilbert space. IMA J. Numer. Anal. 8, 231\u2013252 (1988)","DOI":"10.1093\/imanum\/8.2.231"},{"key":"794_CR21","doi-asserted-by":"crossref","unstructured":"Villacorta, K.D.V., Oliveira, P.R., Soubeyran, A.: A trust-region method for unconstrained multiobjective problems with applications in satisficing processes. J. Optim. Theory Appl. 160, 865\u2013889 (2014)","DOI":"10.1007\/s10957-013-0392-7"},{"key":"794_CR22","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/BF02591750","volume":"31","author":"Y Yuan","year":"1985","unstructured":"Yuan, Y.: Conditions for convergence of trust region algorithm for nonsmooth optimization. Math. Program. 31, 220\u2013228 (1985)","journal-title":"Math. Program."},{"key":"794_CR23","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02591949","volume":"31","author":"Y Yuan","year":"1985","unstructured":"Yuan, Y.: On the superlinear convergence of a trust region algorithm for nonsmooth optimization. Math. Program. 31, 269\u2013285 (1985)","journal-title":"Math. Program."},{"key":"794_CR24","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. Meth. Oper. Res. 58, 283\u2013298 (2003)","journal-title":"Math. Meth. Oper. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0794-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-014-0794-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0794-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T01:48:40Z","timestamp":1565660920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-014-0794-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,22]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["794"],"URL":"https:\/\/doi.org\/10.1007\/s10107-014-0794-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,22]]}}}