{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T17:07:55Z","timestamp":1763399275939},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,10,26]],"date-time":"2007-10-26T00:00:00Z","timestamp":1193356800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2008,11]]},"DOI":"10.1007\/s10589-007-9099-8","type":"journal-article","created":{"date-parts":[[2007,10,24]],"date-time":"2007-10-24T23:48:33Z","timestamp":1193269713000},"page":"225-242","source":"Crossref","is-referenced-by-count":14,"title":["A new trust region method with adaptive radius"],"prefix":"10.1007","volume":"41","author":[{"given":"Zhen-Jun","family":"Shi","sequence":"first","affiliation":[]},{"given":"Jinhua","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,26]]},"reference":[{"key":"9099_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2140\/pjm.1966.16.1","volume":"16","author":"L. Armijo","year":"1966","unstructured":"Armijo, L.: Minimization of functions having Lipschitz continuous partial derivatives. Pac. J. Math. 16, 1\u20133 (1966)","journal-title":"Pac. J. Math."},{"key":"9099_CR2","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1137\/S1052623493252985","volume":"6","author":"R.H. Byrd","year":"1996","unstructured":"Byrd, R.H., Khalfan, H.F., Schnabel, R.B.: Analysis of a symmetric rank-one trust region method. SIAM J. Optim. 6, 1025\u20131039 (1996)","journal-title":"SIAM J. Optim."},{"key":"9099_CR3","doi-asserted-by":"crossref","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-Region Methods. CGT Publications (1999)","DOI":"10.1137\/1.9780898719857"},{"key":"9099_CR4","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/A:1014838419611","volume":"22","author":"Y.H. Dai","year":"2002","unstructured":"Dai, Y.H., Yuan, J.Y., Yuan, Y.: Modified two-point stepsize gradient methods for unconstrained optimization. Comput. Optim. Appl. 22, 103\u2013109 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"9099_CR5","first-page":"1","volume":"18","author":"B.S. He","year":"2000","unstructured":"He, B.S.: Solving trust region problem in large scale optimization. J. Comput. Math. 18, 1\u201312 (2000)","journal-title":"J. Comput. Math."},{"key":"9099_CR6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF02143933","volume":"9","author":"H.P. Helfrich","year":"1995","unstructured":"Helfrich, H.P., Zwick, D.: Trust region algorithms for the nonlinear least distance problem, algorithms for constrained approximation and optimization (Stowe, VT, 1993). Numer. Algorithms 9, 171\u2013179 (1995)","journal-title":"Numer. Algorithms"},{"key":"9099_CR7","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s10898-004-5700-1","volume":"31","author":"L.Z. Liao","year":"2005","unstructured":"Liao, L.Z., Qi, L., Tam, H.W.: A gradient-based continuous method for large-scale optimization problems. J. Glob. Optim. 31, 271\u2013286 (2005)","journal-title":"J. Glob. Optim."},{"key":"9099_CR8","first-page":"447","volume":"100","author":"G.E. Michael","year":"2004","unstructured":"Michael, G.E.: A quasi-Newton trust-region method. Math. Program.\u00a0A 100, 447\u2013470 (2004)","journal-title":"Math. Program.\u00a0A"},{"key":"9099_CR9","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"J.J. Mor\u00e9","year":"1981","unstructured":"Mor\u00e9, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7, 17\u201341 (1981)","journal-title":"ACM Trans. Math. Softw."},{"key":"9099_CR10","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1017\/S0962492900002270","volume":"1","author":"J. Nocedal","year":"1992","unstructured":"Nocedal, J.: Theory of algorithms for unconstrained optimization. Acta Numer. 1, 199\u2013242 (1992)","journal-title":"Acta Numer."},{"key":"9099_CR11","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1014897230089","volume":"22","author":"J. Nocedal","year":"2002","unstructured":"Nocedal, J., Sartenaer, A., Zhu, C.Y.: On the behaviour of the gradient norm in the steepest descent method. Comput. Optim. Appl. 22, 5\u201335 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"9099_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J. Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, J.S.: Numerical Optimization. Springer, New York (1999)"},{"key":"9099_CR13","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1007\/BF02193062","volume":"85","author":"F.A. Potra","year":"1995","unstructured":"Potra, F.A., Shi, Y.: Efficient line search algorithm for unconstrained optimization. J. Optim. Theory Appl. 85, 677\u2013704 (1995)","journal-title":"J. Optim. Theory Appl."},{"key":"9099_CR14","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1017\/S0962492900002841","volume":"7","author":"M.J.D. Powell","year":"1998","unstructured":"Powell, M.J.D.: Direct search algorithms for optimization calculations. Acta Numer. 7, 287\u2013336 (1998)","journal-title":"Acta Numer."},{"key":"9099_CR15","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1137\/0805019","volume":"5","author":"A. Sartenaer","year":"1995","unstructured":"Sartenaer, A.: A class of trust region methods for nonlinear network optimization problems. SIAM J. Optim. 5, 379\u2013407 (1995)","journal-title":"SIAM J. Optim."},{"key":"9099_CR16","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1137\/0722003","volume":"22","author":"G.A. Schultz","year":"1985","unstructured":"Schultz, G.A., Schnabel, R.B., Byrd, R.H.: A family of trust-region-based algorithms for unconstrained minimization with strong global convergence. SIAM J. Numer. Anal. 22, 47\u201367 (1985)","journal-title":"SIAM J. Numer. Anal."},{"key":"9099_CR17","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1023\/A:1008772414083","volume":"16","author":"Y.X. Shi","year":"2000","unstructured":"Shi, Y.X.: Globally convergent algorithms for unconstrained optimization. Comput. Optim. Appl. 16, 295\u2013308 (2000)","journal-title":"Comput. Optim. Appl."},{"key":"9099_CR18","first-page":"393","volume":"157","author":"Z.J. Shi","year":"2004","unstructured":"Shi, Z.J.: Convergence of line search methods for unconstrained optimization. Appl. Math. Comput. 157, 393\u2013405 (2004)","journal-title":"Appl. Math. Comput."},{"key":"9099_CR19","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.cam.2003.10.025","volume":"170","author":"Z.J. Shi","year":"2004","unstructured":"Shi, Z.J., Shen, J.: A gradient-related algorithm with inexact line searches. J. Comput. Appl. Math. 170, 349\u2013370 (2004)","journal-title":"J. Comput. Appl. Math."},{"key":"9099_CR20","first-page":"94","volume":"167","author":"Z.J. Shi","year":"2005","unstructured":"Shi, Z.J., Shen, J.: Convergence of descent method without line search. Appl. Math. Comput. 167, 94\u2013107 (2005)","journal-title":"Appl. Math. Comput."},{"key":"9099_CR21","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s10957-005-6553-6","volume":"127","author":"Z.J. Shi","year":"2005","unstructured":"Shi, Z.J., Shen, J.: New inexact line search method for unconstrained optimization. J. Optim. Theory Appl. 127, 425\u2013446 (2005)","journal-title":"J. Optim. Theory Appl."},{"key":"9099_CR22","first-page":"451","volume":"76","author":"J. Sun","year":"1997","unstructured":"Sun, J.: On piecewise quadratic Newton and trust region problems. Math. Program. 76, 451\u2013467 (1997)","journal-title":"Math. Program."},{"key":"9099_CR23","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1012903105391","volume":"103","author":"J. Sun","year":"2001","unstructured":"Sun, J., Zhang, J.P.: Convergence of conjugate gradient methods without line search. Ann. Oper. Res. 103, 161\u2013173 (2001)","journal-title":"Ann. Oper. Res."},{"key":"9099_CR24","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1023\/B:JOTA.0000043997.42194.dc","volume":"123","author":"X.J. Tong","year":"2004","unstructured":"Tong, X.J., Qi, L.: On the convergence of a trust-region method for solving constrained nonlinear equations with degenerate solutions. J. Optim. Theory Appl. 123, 187\u2013211 (2004)","journal-title":"J. Optim. Theory Appl."},{"key":"9099_CR25","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1023\/A:1022691513687","volume":"95","author":"Z.X. Wei","year":"1997","unstructured":"Wei, Z.X., Qi, L., Jiang, H.: Some convergence properties of descent methods. J. Optim. Theory Appl. 95, 177\u2013188 (1997)","journal-title":"J. Optim. Theory Appl."},{"key":"9099_CR26","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1023\/B:COAP.0000044184.25410.39","volume":"29","author":"Z.X. Wei","year":"2004","unstructured":"Wei, Z.X., Yu, G.H., Yuan, G.L., Lian, Z.G.: The superlinear convergence of a modified BFGS-type method for unconstrained optimization. Comput. Optim. Appl. 29, 315\u2013332 (2004)","journal-title":"Comput. Optim. Appl."},{"key":"9099_CR27","volume-title":"Numerical Methods for Nonlinear Programming","author":"Y. Yuan","year":"1993","unstructured":"Yuan, Y.: Numerical Methods for Nonlinear Programming. Shanghai Scientific & Technical, Shanghai (1993)"},{"key":"9099_CR28","first-page":"333","volume":"16","author":"Y. Yuan","year":"1996","unstructured":"Yuan, Y.: On the convergence of trust region algorithms. Math. Numer. Sinica 16, 333\u2013346 (1996)","journal-title":"Math. Numer. Sinica"},{"key":"9099_CR29","first-page":"7","volume":"1","author":"Y. Yuan","year":"1998","unstructured":"Yuan, Y.: Trust region algorithms for nonlinear equations. Information 1, 7\u201320 (1998)","journal-title":"Information"},{"key":"9099_CR30","unstructured":"Yuan, Y., Sun, W.: Optimization Theory and Methods. Science Press of China (1997)"},{"key":"9099_CR31","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1360\/02ys9067","volume":"45","author":"X.S. Zhang","year":"2002","unstructured":"Zhang, X.S., Zhang, J.L., Liao, L.Z.: An adaptive trust region method and its convergence. Sci. China 45, 620\u2013631 (2002)","journal-title":"Sci. China"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9099-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9099-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9099-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T16:54:08Z","timestamp":1708275248000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9099-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,26]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["9099"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9099-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,26]]}}}