{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T10:00:46Z","timestamp":1768730446036,"version":"3.49.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2017,10,6]],"date-time":"2017-10-06T00:00:00Z","timestamp":1507248000000},"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":["Optim Lett"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s11590-017-1205-y","type":"journal-article","created":{"date-parts":[[2017,10,6]],"date-time":"2017-10-06T15:48:42Z","timestamp":1507304922000},"page":"1911-1927","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method"],"prefix":"10.1007","volume":"12","author":[{"given":"Min","family":"Li","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,6]]},"reference":[{"key":"1205_CR1","first-page":"319","volume":"34","author":"N Andrei","year":"2011","unstructured":"Andrei, N.: Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization. Bull. Malays. Math. Sci. Soc. 34, 319\u2013330 (2011)","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"1205_CR2","first-page":"1","volume":"21","author":"S Babaie-Kafaki","year":"2013","unstructured":"Babaie-Kafaki, S., Reza, G.: A descent family of Dai\u2013Liao conjugate gradient methods. Optim. Methods Softw. 21, 1\u20139 (2013)","journal-title":"Optim. Methods Softw."},{"key":"1205_CR3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/200979.201043","volume":"21","author":"I Bongartz","year":"1995","unstructured":"Bongartz, I., Conn, A., Gould, N., Toint, P.: CUTE: constrained and unconstrained testing environments. ACM Trans. Math. Softw. 21, 123\u2013160 (1995)","journal-title":"ACM Trans. Math. Softw."},{"key":"1205_CR4","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1137\/100813026","volume":"23","author":"Y Dai","year":"2013","unstructured":"Dai, Y., Kou, C.: A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search. SIAM J. Optim. 23, 296\u2013320 (2013)","journal-title":"SIAM J. Optim."},{"key":"1205_CR5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s002450010019","volume":"43","author":"Y Dai","year":"2001","unstructured":"Dai, Y., Liao, L.: New conjugate conditions and related nonlinear conjugate gradient methods. Appl. Math. Optim. 43, 87\u2013101 (2001)","journal-title":"Appl. Math. Optim."},{"key":"1205_CR6","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"Y Dai","year":"2000","unstructured":"Dai, Y., Yuan, Y.: A nonlinear conjugate gradient method with a strong global convergence property. SIAM J. Optim. 10, 177\u2013182 (2000)","journal-title":"SIAM J. Optim."},{"key":"1205_CR7","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.na.2010.09.046","volume":"74","author":"Z Dai","year":"2011","unstructured":"Dai, Z.: Two modified HS type conjugate gradient methods for unconstrained optimization problems. Nonlinear Anal. 74, 927\u2013936 (2011)","journal-title":"Nonlinear Anal."},{"key":"1205_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E Dolan","year":"2002","unstructured":"Dolan, E., Mor\u00e9, J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"1205_CR9","volume-title":"Practical Method of Optimization, Vol. 1: Unconstrained Optimization","author":"R Fletcher","year":"1987","unstructured":"Fletcher, R.: Practical Method of Optimization, Vol. 1: Unconstrained Optimization. Wiley, New York (1987)"},{"key":"1205_CR10","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"R Fletcher","year":"1964","unstructured":"Fletcher, R., Reeves, C.: Function minimization by conjugate gradients. Comput. J. 7, 149\u2013154 (1964)","journal-title":"Comput. J."},{"key":"1205_CR11","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1137\/0802003","volume":"2","author":"J Gilbert","year":"1992","unstructured":"Gilbert, J., Nocedal, J.: Global convergence properties of conjugate gradient methods for optimization. SIAM J. Optim. 2, 21\u201342 (1992)","journal-title":"SIAM J. Optim."},{"key":"1205_CR12","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1137\/030601880","volume":"16","author":"W Hager","year":"2005","unstructured":"Hager, W., Zhang, H.: A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J. Optim. 16, 170\u2013192 (2005)","journal-title":"SIAM J. Optim."},{"key":"1205_CR13","first-page":"35","volume":"2","author":"W Hager","year":"2006","unstructured":"Hager, W., Zhang, H.: A survey of nonlinear conjugate gradient methods. Pac. J. Optim. 2, 35\u201358 (2006)","journal-title":"Pac. J. Optim."},{"key":"1205_CR14","doi-asserted-by":"crossref","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"M Hestenes","year":"1952","unstructured":"Hestenes, M., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Natl. Bur. Stand. 49, 409\u2013436 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"1205_CR15","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1016\/j.cam.2006.03.005","volume":"202","author":"G Li","year":"2007","unstructured":"Li, G., Tang, C., Wei, Z.: New conjugacy condition and related new conjugate gradient methods for unconstrained optimization. J. Comput. Appl. Math. 202, 523\u2013539 (2007)","journal-title":"J. Comput. Appl. Math."},{"key":"1205_CR16","first-page":"1577","volume":"218","author":"M Li","year":"2011","unstructured":"Li, M., Feng, H.: A sufficient descent LS conjugate gradient method for unconstrained optimization problems. Appl. Math. Comput. 218, 1577\u20131586 (2011)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"1205_CR17","first-page":"59","volume":"31","author":"M Li","year":"2012","unstructured":"Li, M., Liu, J., Feng, H.: The global convergence of a descent PRP conjugate gradient method. Comput. Appl. Math. 31(1), 59\u201383 (2012)","journal-title":"Comput. Appl. Math."},{"key":"1205_CR18","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"D Liu","year":"1989","unstructured":"Liu, D., Nocedal, J.: On the limited memory BFGS method for large-scale optimization. Math. Program. 45, 503\u2013528 (1989)","journal-title":"Math. Program."},{"key":"1205_CR19","first-page":"177","volume":"69","author":"Y Liu","year":"1991","unstructured":"Liu, Y., Storey, C.: Efficient generalized conjugate gradient algorithms, part 1: theory. J. Optim. Theory Appl. 69, 177\u2013182 (1991)","journal-title":"J. Optim. Theory Appl."},{"key":"1205_CR20","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":"1205_CR21","unstructured":"Perry, J.M.: A class of conjugate gradient algorithms with a two-step variable-metric memory. Discussion Paper 269, Center for Mathematical Studies in Economics and Management Sciences, Northwestern University, Evanston, Illinois (1977)"},{"key":"1205_CR22","first-page":"35","volume":"16","author":"B Polak","year":"1969","unstructured":"Polak, B., Ribi\u00e8re, G.: Note sur la convergence de m\u00e9thodes de directions conjugu\u00e9es. Rev. Francaise Inform. Recherche. Op\u00e9rat. 16, 35\u201343 (1969)","journal-title":"Rev. Francaise Inform. Recherche. Op\u00e9rat."},{"key":"1205_CR23","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","volume":"9","author":"B Polyak","year":"1969","unstructured":"Polyak, B.: The conjugate gradient method in extreme problems. USSR Comput. Math. Math. Phys. 9, 94\u2013112 (1969)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"1205_CR24","doi-asserted-by":"crossref","unstructured":"Powell, M.: Nonvonvex minimization calculations and the conjugate gradient method. In: Lecture Notes in Mathematics, vol. 1066. Springer, Berlin (1984)","DOI":"10.1007\/BFb0099521"},{"key":"1205_CR25","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1137\/1028154","volume":"28","author":"M Powell","year":"1986","unstructured":"Powell, M.: Convergence properties of algorithms for nonlinear optimization. SIAM Rev. 28, 487\u2013500 (1986)","journal-title":"SIAM Rev."},{"key":"1205_CR26","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1287\/moor.3.3.244","volume":"3","author":"D Shanno","year":"1978","unstructured":"Shanno, D.: Conjugate gradient methods with inexact searches. Math. Oper. Res. 3, 244\u2013256 (1978)","journal-title":"Math. Oper. Res."},{"key":"1205_CR27","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1137\/0715085","volume":"15","author":"DF Shanno","year":"1978","unstructured":"Shanno, D.F.: On the convergence of a new conjugate gradient algorithm. SIAM J. Numer. Anal. 15, 1247\u20131257 (1978)","journal-title":"SIAM J. Numer. Anal."},{"key":"1205_CR28","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1023\/B:COAP.0000026885.81997.88","volume":"28","author":"H Yabe","year":"2004","unstructured":"Yabe, H., Takano, M.: Global convergence properties of nonlinear conjugate gradient methods with modified secant condition. Comput. Optim. Appl. 28, 203\u2013225 (2004)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"1205_CR29","first-page":"11","volume":"45","author":"G Yu","year":"2006","unstructured":"Yu, G., Guan, L.: Modified PRP methods with sufficient descent property and their convergence properties. Acta Scientiarum Naturalium Universitatis Sunyatseni 45(4), 11\u201314 (2006). (Chinese)","journal-title":"Acta Scientiarum Naturalium Universitatis Sunyatseni"},{"key":"1205_CR30","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/s11590-008-0086-5","volume":"3","author":"G Yuan","year":"2009","unstructured":"Yuan, G.: Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems. Optim. Lett. 3, 11\u201321 (2009)","journal-title":"Optim. Lett."},{"key":"1205_CR31","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1023\/A:1021898630001","volume":"102","author":"J Zhang","year":"1999","unstructured":"Zhang, J., Deng, N., Chen, L.: New quasi-Newton equation and related methods for unconstrained optimization. J. Optim. Theory Appl. 102, 147\u2013167 (1999)","journal-title":"J. Optim. Theory Appl."},{"key":"1205_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cam.2008.06.012","volume":"28","author":"L Zhang","year":"2009","unstructured":"Zhang, L.: New versions of the Hestenes\u2013Stiefel nonlinear conjugate gradient method based on the secant condition for optimization. Comput. Appl. Math. 28, 1\u201323 (2009)","journal-title":"Comput. Appl. Math."},{"key":"1205_CR33","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1093\/imanum\/drl016","volume":"26","author":"L Zhang","year":"2006","unstructured":"Zhang, L., Zhou, W., Li, D.: A descent modified Polak\u2013Ribi\u00e8re\u2013Polyak conjugate gradient method and its global convergence. IMA J. Numer. Anal. 26, 629\u2013640 (2006)","journal-title":"IMA J. Numer. Anal."},{"key":"1205_CR34","first-page":"37","volume-title":"Integer and Nonlinear Programming","author":"G Zoutendijk","year":"1970","unstructured":"Zoutendijk, G.: Nonlinear programming, computational methods. In: Abadie, J. (ed.) Integer and Nonlinear Programming, pp. 37\u201386. North-Holland, Amsterdam (1970)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-017-1205-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1205-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1205-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T09:58:15Z","timestamp":1570183095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-017-1205-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,6]]},"references-count":34,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["1205"],"URL":"https:\/\/doi.org\/10.1007\/s11590-017-1205-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,6]]}}}