{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T06:50:35Z","timestamp":1774507835390,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,5,2]],"date-time":"2014-05-02T00:00:00Z","timestamp":1398988800000},"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":["Numer Algor"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s11075-014-9866-4","type":"journal-article","created":{"date-parts":[[2014,4,30]],"date-time":"2014-04-30T21:36:08Z","timestamp":1398893768000},"page":"671-689","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["A new nonmonotone line search technique for unconstrained optimization"],"prefix":"10.1007","volume":"68","author":[{"given":"Shuai","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhong","family":"Wan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,2]]},"reference":[{"key":"9866_CR1","doi-asserted-by":"crossref","first-page":"3397","DOI":"10.1016\/j.cam.2010.05.002","volume":"234","author":"N Andrei","year":"2010","unstructured":"Andrei, N.: New accelerated conjugate gradient algorithms as a modification of Dai-Yuan\u2019s computational scheme for unconstrained optimization. J. Comput. Appl. Math. 234, 3397\u20133410 (2010)","journal-title":"J. Comput. Appl. Math."},{"key":"9866_CR2","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s10589-007-9055-7","volume":"38","author":"N Andrei","year":"2007","unstructured":"Andrei, N.: Scaled conjugate gradient algorithms for unconstrained optimization. Comput. Optim. Appl. 38, 401\u2013416 (2007)","journal-title":"Comput. Optim. Appl."},{"key":"9866_CR3","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 first partial derivatives. Pac. J. Math. 16, 1\u20133 (1966)","journal-title":"Pac. J. Math."},{"key":"9866_CR4","doi-asserted-by":"crossref","unstructured":"Deng, S., Wan, Z., Chen, X.: An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems. J. Optim. Theory Appl. (2013). doi: 10.1007\/s10957-012-0239-7","DOI":"10.1007\/s10957-012-0239-7"},{"key":"9866_CR5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profile. Math. Prog. 91, 201\u2013213 (2002)","journal-title":"Math. Prog."},{"key":"9866_CR6","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."},{"key":"9866_CR7","first-page":"147","volume":"3","author":"AA Goldstein","year":"1965","unstructured":"Goldstein, A.A.: On steepest descen. SIAM J. Control 3, 147\u2013151 (1965)","journal-title":"SIAM J. Control"},{"key":"9866_CR8","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, 707\u2013716 (1986)","journal-title":"SIAM J. Numer. Anal."},{"key":"9866_CR9","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF00940345","volume":"60","author":"L Grippo","year":"1989","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A truncated Newton method with nonmonotone line search for unconstrained optimization. J. Optim. Theory Appl. 60, 401\u2013419 (1989)","journal-title":"J. Optim. Theory Appl."},{"key":"9866_CR10","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1007\/BF01385810","volume":"59","author":"L Grippo","year":"1991","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A class of nonmonotone stabilization methods in unconstrained optimization. Numer. Math. 59, 779\u2013805 (1991)","journal-title":"Numer. Math."},{"key":"9866_CR11","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"NIM Gould","year":"2003","unstructured":"Gould, N.I.M., Orban, D., Toint, P.H.: CUTEr and SifDec: a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29, 373\u2013394 (2003)","journal-title":"ACM Trans. Math. Softw."},{"key":"9866_CR12","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/1132973.1132979","volume":"32","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: Algorithm 851: CG_DESCENT, a conjugate gradient method with guaranteed descent. ACM Trans. Math. Softw. 32, 113\u2013137 (2006)","journal-title":"ACM Trans. Math. Softw."},{"key":"9866_CR13","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/s10915-009-9314-0","volume":"42","author":"SL Hu","year":"2010","unstructured":"Hu, S.L., Huang, Z.H., Lu, N.: A non-monotone line search algorithm for unconstrained optimization. J. Sci. Comput. 42, 38\u201353 (2010)","journal-title":"J. Sci. Comput."},{"key":"9866_CR14","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"DC Liu","year":"1989","unstructured":"Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Math. Prog. 45, 503\u2013528 (1989)","journal-title":"Math. Prog."},{"key":"9866_CR15","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"JJ 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":"9866_CR16","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","volume":"35","author":"J Nocedal","year":"1980","unstructured":"Nocedal, J.: Updating quasi-Newton matrices with limited storage. Math. Comput. 35, 773\u2013782 (1980)","journal-title":"Math. Comput."},{"key":"9866_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, Berlin (1999)"},{"key":"9866_CR18","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1137\/0728063","volume":"28","author":"ER Panier","year":"1991","unstructured":"Panier, E.R., Tits, A.L.: Avoiding the Maratos effect by means of a nonmonotone line search I. General constrained problems. SIAM J. Numer. Anal. 28, 1183\u20131195 (1991)","journal-title":"SIAM J. Numer. Anal."},{"key":"9866_CR19","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1137\/S1052623494266365","volume":"7","author":"M Raydan","year":"1997","unstructured":"Raydan, M.: The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem. SIAM J. Optim. 7, 26\u201333 (1997)","journal-title":"SIAM J. Optim."},{"key":"9866_CR20","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1137\/S106482759427021X","volume":"17","author":"PL Toint","year":"1996","unstructured":"Toint, P.L.: An assessment of nonmonotone linesearch techniques for unconstrained optimization. SIAM J. Sci. Comput. 17, 725\u2013739 (1996)","journal-title":"SIAM J. Sci. Comput."},{"key":"9866_CR21","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1137\/1011036","volume":"11","author":"P Wolfe","year":"1968","unstructured":"Wolfe, P.: Convergence conditions for ascent methods. SIAM Rev. 11, 226\u2013235 (1968)","journal-title":"SIAM Rev."},{"key":"9866_CR22","doi-asserted-by":"crossref","unstructured":"Wan, Z., Chen, Y., Huang, S., Feng, D.: A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations. Optim. Lett. (2014). doi: 10.1007\/s11590-013-0678-6","DOI":"10.1007\/s11590-013-0678-6"},{"key":"9866_CR23","first-page":"387","volume":"33","author":"Z Wan","year":"2011","unstructured":"Wan, Z., Feng, D.: Investigation on a class of nonmonotone cautious BFGS algorithms. Math. Numer. Sin. 33, 387\u2013396 (2011)","journal-title":"Math. Numer. Sin."},{"key":"9866_CR24","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.3934\/dcdsb.2011.16.1157","volume":"16","author":"Z Wan","year":"2011","unstructured":"Wan, Z., Hu, C.M., Yang, Z.L.: A spectral PRP conjugate gradient methods for nonconvex optimization problem based on modified line search. Discret. Contin. Dyn. Syst. Ser. B 16, 1157\u20131169 (2011)","journal-title":"Discret. Contin. Dyn. Syst. Ser. B"},{"key":"9866_CR25","doi-asserted-by":"crossref","unstructured":"Wan, Z., Huang, S., Zheng, X.D.: New cautious BFGS algorithm based on modified Armijo-type line search. J. Inequal. Appl. (2012). doi: 10.1186\/1029-242X-2012-241","DOI":"10.1186\/1029-242X-2012-241"},{"key":"9866_CR26","doi-asserted-by":"crossref","unstructured":"Wan, Z., Teo, K.L., Shen, X.L., Hu, C.M.: New BFGS method for unconstrained optimization problem based on modified Armijo line search. Optimization. (2012). doi: 10.1080\/02331934.2011.644284","DOI":"10.1080\/02331934.2011.644284"},{"key":"9866_CR27","first-page":"37","volume":"143","author":"G Zoutendijk","year":"1970","unstructured":"Zoutendijk, G.: Nonlinear programming, computational methods. Integer Nonlinear Program. 143, 37\u201386 (1970)","journal-title":"Integer Nonlinear Program."},{"key":"9866_CR28","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, 1043\u20131056 (2004)","journal-title":"SIAM J. Optim."},{"key":"9866_CR29","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/BF00939377","volume":"76","author":"JL Zhou","year":"1993","unstructured":"Zhou, J.L, Tits, A.L.: Nonmonotone line search for minimax problems. J. Optim. Theory Appl. 76, 455\u2013476 (1993)","journal-title":"J. Optim. Theory Appl."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-014-9866-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-014-9866-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-014-9866-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:08:24Z","timestamp":1559351304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-014-9866-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,2]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["9866"],"URL":"https:\/\/doi.org\/10.1007\/s11075-014-9866-4","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,2]]}}}