{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T05:04:34Z","timestamp":1771650274893,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,10,10]],"date-time":"2012-10-10T00:00:00Z","timestamp":1349827200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s11075-012-9652-0","type":"journal-article","created":{"date-parts":[[2012,10,9]],"date-time":"2012-10-09T04:24:04Z","timestamp":1349756644000},"page":"1-20","source":"Crossref","is-referenced-by-count":8,"title":["A nonmonotone trust region method with new inexact line search for unconstrained optimization"],"prefix":"10.1007","volume":"64","author":[{"given":"Jinghui","family":"Liu","sequence":"first","affiliation":[]},{"given":"Changfeng","family":"Ma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,10,10]]},"reference":[{"key":"9652_CR1","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/j.camwa.2010.04.034","volume":"60","author":"M Ahookhosh","year":"2010","unstructured":"Ahookhosh, M., Amini, K.: A nonmotone trust region method with adaptive radius for unconstrained optimization. Comput. Math. Appl. 60, 411\u2013422 (2010)","journal-title":"Comput. Math. Appl."},{"key":"9652_CR2","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/j.apm.2011.07.021","volume":"36","author":"M Ahookhosh","year":"2012","unstructured":"Ahookhosh, M., Amini, K., Peyghami, M.R.: A nonmonotone trust-region line search method for large-scale unconstrained optimization. Appl. Math. Model. 36, 478\u2013487 (2012)","journal-title":"Appl. Math. Model."},{"issue":"2","key":"9652_CR3","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF00939455","volume":"64","author":"D Touati-Ahmed","year":"1990","unstructured":"Touati-Ahmed, D., Storey, C.: Efficient hybrid conjugate gradient techniques. J. Optim. Theory Appl. 64(2), 379\u2013397 (1990)","journal-title":"J. Optim. Theory Appl."},{"key":"9652_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, Ph.L.: Trust-region Methods. SIAM Publications, Philadelphia, PA (2000)"},{"key":"9652_CR5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., More, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"2","key":"9652_CR6","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF00939608","volume":"76","author":"NY Deng","year":"1993","unstructured":"Deng, N.Y., Xiao, Y., Zhou, F.J.: Nonmonotonic trust region algorithm. J. Optim. Theory Appl. 76(2), 259\u2013285 (1993)","journal-title":"J. Optim. Theory Appl."},{"key":"9652_CR7","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1023\/A:1013653923062","volume":"112","author":"YH Dai","year":"2002","unstructured":"Dai, Y.H.: On the nonmonotone line search. J. Optim. Theory Appl. 112, 315\u2013330 (2002)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"9652_CR8","first-page":"139","volume":"15","author":"YH Dai","year":"2002","unstructured":"Dai, Y.H.: A nonmonotone conjugate gradient algorithm for unconstrained optimization. J. Syst. Sci. Complex 15(2), 139\u2013145 (2002)","journal-title":"J. Syst. Sci. Complex"},{"key":"9652_CR9","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01584540","volume":"2","author":"R Fletcher","year":"1972","unstructured":"Fletcher, R.: An algorithm for solving linearly constrained optimization problems. Math. Program. 2, 133\u2013165 (1972)","journal-title":"Math. Program."},{"issue":"1","key":"9652_CR10","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/j.amc.2004.02.011","volume":"163","author":"J Fu","year":"2005","unstructured":"Fu, J., Sun, W.: Nonmotone adaptive trust region method for unconstrained optimization problems. Appl. Math. Comput. 163(1), 489\u2013504 (2005)","journal-title":"Appl. Math. Comput."},{"key":"9652_CR11","unstructured":"Gertz, E.M.: Combination trust-region line search methods for unconstrained optimization. Ph.D. thesis, University of California, San Diego (1999)"},{"issue":"4","key":"9652_CR12","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line search technique for Newton\u2019s method. SIAM J. Numer. Anal. 23(4), 707\u2013716 (1986)","journal-title":"SIAM J. Numer. Anal."},{"key":"9652_CR13","doi-asserted-by":"crossref","first-page":"2158","DOI":"10.1016\/j.camwa.2007.08.038","volume":"55","author":"NZ Gu","year":"2008","unstructured":"Gu, N.Z., Mo, J.T.: Incorporating nonmonotone strategies into the trust region method for unconstrained optimization. Appl. Math. Comput. 55, 2158\u20132172 (2008)","journal-title":"Appl. Math. Comput."},{"key":"9652_CR14","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1020587701058","volume":"23","author":"L Grippo","year":"2002","unstructured":"Grippo, L., Sciandrone, M.: Nonmonotone globalization techniques for the Barzilai-Borwein gradient method. Comput. Optim. Appl. 23, 143\u2013169 (2002)","journal-title":"Comput. Optim. Appl."},{"issue":"9","key":"9652_CR15","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1007\/BF02880001","volume":"41","author":"X Ke","year":"1998","unstructured":"Ke, X., Han, J.: A class of nonmotone trust region algorithms for unconstrained optimization. Sci. China Ser. A 41(9), 927\u2013932 (1998)","journal-title":"Sci. China Ser. A"},{"key":"9652_CR16","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1080\/02331939508844101","volume":"34","author":"G Liu","year":"1995","unstructured":"Liu, G., Han, J., Sun, D.: Global convergence of BFGS algorithm with nonmonotone linesearch. Optim. 34, 147\u2013159 (1995)","journal-title":"Optim."},{"key":"9652_CR17","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.cam.2006.10.070","volume":"209","author":"JT Mo","year":"2007","unstructured":"Mo, J.T., Liu, C.Y., Yan, S.C.: A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values. J. Comput. Appl. Math. 209, 97\u2013108 (2007)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"9652_CR18","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"JJ More","year":"1981","unstructured":"More, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7(1), 17\u201341 (1981)","journal-title":"ACM Trans. Math. Softw."},{"key":"9652_CR19","first-page":"153","volume-title":"Advances in Nonlinear Programming","author":"J Nocedal","year":"1996","unstructured":"Nocedal, J., Yuan, Y.: Combining trust region and line search techniques. In: Yuan, Y. (ed.) Advances in Nonlinear Programming, pp. 153\u2013175. Kluwer Academic Publishers, Dordrecht (1996)"},{"key":"9652_CR20","first-page":"1","volume-title":"Nonlinear Programming, vol. 2","author":"MJD Powell","year":"1975","unstructured":"Powell, M.J.D.: Convergence properties of a class minimization algorithms. In: Mangasarian, O.L., Meyer, R.R., Robinson, S.M. (eds.) Nonlinear Programming, vol. 2, pp. 1\u201325. Academic Press, New York (1975)"},{"key":"9652_CR21","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF01588787","volume":"49","author":"MJD Powell","year":"1990","unstructured":"Powell, M.J.D., Yuan, Y.: A trust region algorithm for equality constrained optimization. Math. Program. 49, 189\u2013213 (1990)","journal-title":"Math. Program."},{"issue":"1","key":"9652_CR22","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.amc.2003.07.018","volume":"156","author":"WY Sun","year":"2004","unstructured":"Sun, W.Y.: Nonmonotone trust region method for solving optimization problems. Appl. Math. Comput. 156(1), 59\u2013174 (2004)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"9652_CR23","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s10957-005-6553-6","volume":"127","author":"ZJ Shi","year":"2005","unstructured":"Shi, Z.J., Shen, J.: New inexact line search method for unconstrained optimization. J. Optim. Theory Appl. 127(2), 425\u2013446 (2005)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"9652_CR24","first-page":"101","volume":"26","author":"ZJ Shi","year":"2006","unstructured":"Shi, Z.J., Sun, G.: A diagonal-sparse quasi-Newton method for unconstrained optimization problem. J. Sys. Sci Math. Sci. 26(1), 101\u2013112 (2006)","journal-title":"J. Sys. Sci Math. Sci."},{"key":"9652_CR25","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0377-0427(02)00420-X","volume":"146","author":"WY Sun","year":"2002","unstructured":"Sun, W.Y., Han, J.Y., Sun, J.: On the global convergence of nonmonotone descent methods. J. Comput. Appl. Math. 146, 89\u201398 (2002)","journal-title":"J. Comput. Appl. Math."},{"key":"9652_CR26","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.ejor.2010.09.007","volume":"208","author":"ZJ Shi","year":"2011","unstructured":"Shi, Z.J., Wang, S.Q.: Nonmonotone adaptive trust region method. Eur. J. Oper. Res. 208, 28\u201336 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9652_CR27","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1137\/S106482759427021X","volume":"17","author":"PhL Toint","year":"1996","unstructured":"Toint, Ph.L.: An assessment of non-monotone line search techniques for unconstrained optimization. SIAM J. Sci. Stat. Comput. 17(3), 725\u2013739 (1996)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"9652_CR28","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01580852","volume":"47","author":"Y Yuan","year":"1990","unstructured":"Yuan, Y.: On a subproblem of trust region algorithms for constrained optimization. Math. Program. 47, 53\u201363 (1990)","journal-title":"Math. Program."},{"issue":"4","key":"9652_CR29","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"H Zhang","year":"2004","unstructured":"Zhang, H., Hager, W.W.: A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim. 14(4), 1043\u20131056 (2004)","journal-title":"SIAM J. Optim."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-012-9652-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-012-9652-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-012-9652-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T05:08:20Z","timestamp":1559365700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-012-9652-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,10]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["9652"],"URL":"https:\/\/doi.org\/10.1007\/s11075-012-9652-0","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,10]]}}}