{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T23:17:03Z","timestamp":1776813423945,"version":"3.51.2"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,12,11]],"date-time":"2015-12-11T00:00:00Z","timestamp":1449792000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Chinese NSF grant","award":["61179033"],"award-info":[{"award-number":["61179033"]}]},{"name":"Collaborative Innovation Center on Beijing Society-buliding and Social Governance"},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2014M561081"],"award-info":[{"award-number":["2014M561081"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s11590-015-0976-2","type":"journal-article","created":{"date-parts":[[2015,12,11]],"date-time":"2015-12-11T11:19:23Z","timestamp":1449832763000},"page":"947-965","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A nonmonotone inexact Newton method for unconstrained optimization"],"prefix":"10.1007","volume":"11","author":[{"given":"Huan","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai-Bin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi-Bao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"Tadjouddine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,11]]},"reference":[{"key":"976_CR1","unstructured":"Ahookhosh, M., Ghaderi, S.: On efficiency of nonmonotone Armijo-type line searches. arXiv preprint arXiv:1408.2675 , (2014)"},{"issue":"1","key":"976_CR2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s11075-013-9723-x","volume":"66","author":"K Amini","year":"2014","unstructured":"Amini, K., Ahookhosh, M., Nosratipour, H.: An inexact line search approach using modified nonmonotone strategy for unconstrained optimization. Numer. Algorithms 66(1), 49\u201378 (2014)","journal-title":"Numer. Algorithms"},{"issue":"4","key":"976_CR3","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1023\/A:1013844413130","volume":"27","author":"YH Dai","year":"2001","unstructured":"Dai, Y.H., Zhang, H.C.: Adaptive two-point stepsize gradient algorithm. Numer. Algorithms 27(4), 377\u2013385 (2001)","journal-title":"Numer. Algorithms"},{"issue":"2","key":"976_CR4","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(2), 315\u2013330 (2002)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"976_CR5","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1137\/0719025","volume":"19","author":"RS Dembo","year":"1982","unstructured":"Dembo, R.S., Eisenstat, S.C., Steihaug, T.: Inexact Newton method. SIAM J. Numer. Anal. 19(2), 400\u2013408 (1982)","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"976_CR6","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/BF02592055","volume":"26","author":"RS Dembo","year":"1983","unstructured":"Dembo, R.S., Steihaug, T.: Truncated-Newton algorithms for large-scale unconstrained optimization. Math. Program. 26(2), 190\u2013212 (1983)","journal-title":"Math. Program."},{"issue":"2","key":"976_CR7","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."},{"issue":"1","key":"976_CR8","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1023\/A:1004614012113","volume":"105","author":"NY Deng","year":"2000","unstructured":"Deng, N.Y., Wang, Z.Z.: Theoretical efficiency of an inexact Newton method. J. Optim. Theory Appl. 105(1), 97\u2013112 (2000)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"976_CR9","doi-asserted-by":"crossref","first-page":"999","DOI":"10.3934\/jimo.2015.11.999","volume":"11","author":"H Gao","year":"2015","unstructured":"Gao, H., Tong, X.J., Dai, Y.H.: Barzilai-Borwein-like methods for the extreme eigenvalue problem. J. Ind. Manag. Optim. 11(3), 999\u20131019 (2015)","journal-title":"J. Ind. Manag. Optim."},{"key":"976_CR10","volume-title":"Matrix Computations","author":"GH Golub","year":"2012","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations. JHU Press, Baltimore (2012)"},{"key":"976_CR11","doi-asserted-by":"crossref","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: CUTEr and SifDec: A constrained and unconstrained testing environment, revisited. ACM T. Math. Software(TOMS). 29(4), 373\u2013394 (2003)","DOI":"10.1145\/962437.962439"},{"issue":"4","key":"976_CR12","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo, L., Lamparillo, 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":"976_CR13","volume-title":"Newton-type algorithms with nonmonotone line search for large-scale unconstrained optimization","author":"L Grippo","year":"1988","unstructured":"Grippo, L., Lamparillo, F., Lucidi, S.: Newton-type algorithms with nonmonotone line search for large-scale unconstrained optimization. Springer, Berlin (1988)"},{"issue":"3","key":"976_CR14","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF00940345","volume":"60","author":"L Grippo","year":"1989","unstructured":"Grippo, L., Lamparillo, F., Lucidi, S.: A truncated Newton method with nonmonotone line search for unconstrained optimization. J. Optim. Theory Appl. 60(3), 401\u2013419 (1989)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"976_CR15","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1007\/BF01385810","volume":"59","author":"L Grippo","year":"1991","unstructured":"Grippo, L., Lamparillo, F., Lucidi, S.: A class of nonmonotone stabilization methods in unconstrained optimization. Numer. Math. 59(1), 779\u2013805 (1991)","journal-title":"Numer. Math."},{"issue":"4","key":"976_CR16","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1080\/10556788.2012.656115","volume":"28","author":"B Jiang","year":"2013","unstructured":"Jiang, B., Dai, Y.H.: Feasible Barzilai-Borwein-like methods for extreme symmetric eigenvalue problems. Optim. Method Softw. 28(4), 756\u2013784 (2013)","journal-title":"Optim. Method Softw."},{"issue":"2","key":"976_CR17","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 convergece of the BFGS algorithm with nonmonotone linesearch. Optimization 34(2), 147\u2013159 (1995)","journal-title":"Optimization"},{"key":"976_CR18","unstructured":"Lu, Z.S., Xiao, L.: Randomized block coordinate non-monotone gradient method for a class of nonlinear programming. (2013). arXiv:1306.5918"},{"key":"976_CR19","doi-asserted-by":"crossref","unstructured":"Saad, Y.: Iterative methods for sparse linear systems. SIAM (2003)","DOI":"10.1137\/1.9780898718003"},{"issue":"3","key":"976_CR20","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF02614518","volume":"77","author":"PL Toint","year":"1997","unstructured":"Toint, P.L.: Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints. Math. Program. 77(3), 69\u201394 (1997)","journal-title":"Math. Program."},{"key":"976_CR21","volume-title":"Towards an efficient sparsity exploiting Newton method for minimization. Sparse matrices and their uses","author":"PL Toint","year":"1981","unstructured":"Toint, P.L.: Towards an efficient sparsity exploiting Newton method for minimization. Sparse matrices and their uses. Academic Press, London (1981)"},{"issue":"2","key":"976_CR22","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10898-007-9134-4","volume":"39","author":"HB Zhang","year":"2007","unstructured":"Zhang, H.B., Deng, N.Y.: An improved inexact Newton method. J. Glob. Optim. 39(2), 221\u2013234 (2007)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"976_CR23","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/j.amc.2003.12.074","volume":"161","author":"D Zhu","year":"2005","unstructured":"Zhu, D.: Nonmonotone backtracking inexact quasi-Newton algorithms for solving smooth nonlinear equations. Appl. Math. Comput. 161(3), 875\u2013895 (2005)","journal-title":"Appl. Math. Comput."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0976-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0976-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0976-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0976-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T00:04:39Z","timestamp":1718237079000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0976-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,11]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["976"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0976-2","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,11]]}}}