{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T18:58:58Z","timestamp":1781204338353,"version":"3.54.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,11,12]],"date-time":"2022-11-12T00:00:00Z","timestamp":1668211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,12]],"date-time":"2022-11-12T00:00:00Z","timestamp":1668211200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Science Foundation of Zhejiang Sci-Tech University","award":["21062347-Y"],"award-info":[{"award-number":["21062347-Y"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11661009"],"award-info":[{"award-number":["11661009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the High Level Innovation Teams and Excellent Scholars Program in Guangxi institutions of higher education of China","award":["[2019]52"],"award-info":[{"award-number":["[2019]52"]}]},{"name":"the Guangxi Natural Science Key Foundation","award":["2017GXNSFDA198046"],"award-info":[{"award-number":["2017GXNSFDA198046"]}]},{"name":"the Special Funds for Local Science and Technology Development Guided by the Central Government","award":["ZY20198003"],"award-info":[{"award-number":["ZY20198003"]}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11801503"],"award-info":[{"award-number":["11801503"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Zhejiang Provincial Natural Science Foundation of China","award":["LY20A010025"],"award-info":[{"award-number":["LY20A010025"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s11075-022-01448-y","type":"journal-article","created":{"date-parts":[[2022,11,12]],"date-time":"2022-11-12T10:02:58Z","timestamp":1668247378000},"page":"949-970","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A class of new three-term descent conjugate gradient algorithms for large-scale unconstrained optimization and applications to image restoration problems"],"prefix":"10.1007","volume":"93","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6926-1765","authenticated-orcid":false,"given":"Xiaoliang","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gonglin","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liping","family":"Pang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,11,12]]},"reference":[{"key":"1448_CR1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"2","author":"R Fletcher","year":"1964","unstructured":"Fletcher, R., Reeves, C.: Function minimization by conjugate gradients. Comput. J. 2, 149\u2013154 (1964)","journal-title":"Comput. J."},{"issue":"4","key":"1448_CR2","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","volume":"9","author":"BT Polyak","year":"1969","unstructured":"Polyak, B.T.: The conjugate gradient method in extreme problems. USSR Comput. Math. Math. Phys. 9(4), 94\u2013112 (1969)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"3","key":"1448_CR3","first-page":"35","volume":"16","author":"E Polak","year":"1969","unstructured":"Polak, E., Ribi\u00e8re, G.: Note sur la convergence de m\u00e9thodes de directions conjugu\u00e9es. Rev. Fran\u00e7,aise Informat. Recherche Op\u00e9rationnelle 16 (3), 35\u201343 (1969)","journal-title":"Rev. Fran\u00e7,aise Informat. Recherche Op\u00e9rationnelle"},{"issue":"1","key":"1448_CR4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"Y Dai","year":"1999","unstructured":"Dai, Y., Yuan, Y.: A nonlinear conjugate gradient method with a strong global convergence property. SIAM J. Optim. 10(1), 177\u2013182 (1999)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"1448_CR5","first-page":"409","volume":"49","author":"R Hestenes","year":"1952","unstructured":"Hestenes, R, Stiefel, L.: Methods of conjugate gradients for solving linear systems. J. R. National Bureau Standards (United States) 49(6), 409\u2013436 (1952)","journal-title":"J. R. National Bureau Standards (United States)"},{"issue":"1","key":"1448_CR6","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(1), 21\u201342 (1992)","journal-title":"SIAM J. Optim."},{"key":"1448_CR7","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1016\/j.apm.2017.02.008","volume":"47","author":"G Yuan","year":"2017","unstructured":"Yuan, G, Wei, Z, Lu, X.: Global convergence of BFGS and PRP methods under a modified weak Wolfe\u2013Powell line search. Appl. Math. Model. 47, 811\u2013825 (2017)","journal-title":"Appl. Math. Model."},{"key":"1448_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.apnum.2020.01.019","volume":"152","author":"G Yuan","year":"2020","unstructured":"Yuan, G, Lu, J, Wang, Z.: The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems. Appl. Numer. Math. 152, 1\u201311 (2020)","journal-title":"Appl. Numer. Math."},{"issue":"2","key":"1448_CR9","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1137\/S1052623494268443","volume":"10","author":"Y Dai","year":"2000","unstructured":"Dai, Y., Han, J., Liu, G., Sun, D., Yin, H., Yuan, Y.: Convergence properties of nonlinear conjugate gradient methods. SIAM J. Optim. 10(2), 345\u2013358 (2000)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1448_CR10","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1007\/s11075-019-00787-7","volume":"84","author":"G Yuan","year":"2020","unstructured":"Yuan, G., Wang, X., Sheng, Z.: Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions. Numer. Alg. 84 (3), 935\u2013956 (2020)","journal-title":"Numer. Alg."},{"issue":"1","key":"1448_CR11","first-page":"35","volume":"2","author":"W Hager","year":"2006","unstructured":"Hager, W., Zhang, H.: A survey of nonlinear conjugate gradient methods. Pacific J. Optim. 2(1), 35\u201358 (2006)","journal-title":"Pacific J. Optim."},{"issue":"4","key":"1448_CR12","first-page":"333","volume":"16","author":"N Andrei","year":"2007","unstructured":"Andrei, N.: Numerical comparison of conjugate gradient algorithms for unconstrained optimization. Studies Inform. Contr. 16(4), 333\u2013352 (2007)","journal-title":"Studies Inform. Contr."},{"issue":"2","key":"1448_CR13","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1080\/01630563.2018.1535506","volume":"40","author":"K Zhang","year":"2019","unstructured":"Zhang, K, Liu, H, Liu, Z.: A new Dai-Liao conjugate gradient method with optimal parameter choice. Numer. Functional Anal. Optim. 40(2), 194\u2013215 (2019)","journal-title":"Numer. Functional Anal. Optim."},{"issue":"2","key":"1448_CR14","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1080\/00207160.2017.1290433","volume":"95","author":"X Li","year":"2018","unstructured":"Li, X., Wang, X., Sheng, Z., Duan, X.: A modified conjugate gradient algorithm with backtracking line search technique for large-scale nonlinear equations. Int. J. Comput. Math. 95(2), 382\u2013395 (2018)","journal-title":"Int. J. Comput. Math."},{"issue":"2","key":"1448_CR15","first-page":"319","volume":"2","author":"N Andrei","year":"2011","unstructured":"Andrei, N.: Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization. Bullet. Malaysian Math. Society Series 2 (2), 319\u2013330 (2011)","journal-title":"Bullet. Malaysian Math. Society Series"},{"issue":"1","key":"1448_CR16","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s002450010019","volume":"43","author":"Y Dai","year":"2001","unstructured":"Dai, Y., Liao, L.: New conjugacy conditions and related nonlinear conjugate gradient methods. Appl. Math. Optim. 43(1), 87\u2013101 (2001)","journal-title":"Appl. Math. Optim."},{"key":"1448_CR17","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1007\/s11075-017-0362-5","volume":"77","author":"N Andrei","year":"2018","unstructured":"Andrei, N.: A Dai-Liao conjugate gradient algorithm with clustering of eigenvalues. Numer. Alg. 77, 1273\u20131282 (2018)","journal-title":"Numer. Alg."},{"issue":"3","key":"1448_CR18","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/j.ejor.2013.11.012","volume":"234","author":"S Babaie-kafaki","year":"2014","unstructured":"Babaie-kafaki, S., Ghanbari, R.: The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices. Eur. J. Oper. Res. 234(3), 625\u2013630 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"1448_CR19","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1007\/s10957-020-01710-0","volume":"186","author":"G Yuan","year":"2020","unstructured":"Yuan, G., Wang, X., Sheng, Z.: The projection technique for two open problems of unconstrained optimization problems. J. Optim. Theory Appl. 186, 590\u2013619 (2020)","journal-title":"J. Optim. Theory Appl."},{"key":"1448_CR20","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s10957-015-0781-1","volume":"168","author":"G Yuan","year":"2016","unstructured":"Yuan, G., Meng, Z., Li, Y.: A modified hestenes and stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations. J. Optim. Theory Appl. 168, 129\u2013152 (2016)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"1448_CR21","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1080\/10556788.2014.1001511","volume":"30","author":"M Peyghami","year":"2015","unstructured":"Peyghami, M., Ahmadzadeh, H., Fazli, A.: A new class of efficient and globally convergent conjugate gradient methods in the Dai-Liao family. Optim. Methods Softw. 30(4), 843\u2013863 (2015)","journal-title":"Optim. Methods Softw."},{"key":"1448_CR22","doi-asserted-by":"crossref","first-page":"1255","DOI":"10.1007\/s11075-017-0422-x","volume":"78","author":"S Yao","year":"2018","unstructured":"Yao, S., He, D., Shi, L.: An improved perry conjugate gradient method with adaptive parameter choice. Numer. Alg. 78, 1255\u20131269 (2018)","journal-title":"Numer. Alg."},{"issue":"2","key":"1448_CR23","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1007\/s10957-017-1140-1","volume":"175","author":"Y Zheng","year":"2017","unstructured":"Zheng, Y., Zheng, B.: Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems. J. Optim. Theory Appl. 175(2), 502\u2013509 (2017)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1448_CR24","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(1), 170\u2013192 (2005)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1448_CR25","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(1), 296\u2013320 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1448_CR26","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10589-014-9662-z","volume":"60","author":"M Al-Baali","year":"2015","unstructured":"Al-Baali, M., Narushima, Y., Yabe, H.: A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization. Comput. Optim. Appl. 60(1), 89\u2013110 (2015)","journal-title":"Comput. Optim. Appl."},{"key":"1448_CR27","doi-asserted-by":"crossref","unstructured":"Eslahchi, M., Bojari, S.: Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization. Optim. Methods Softw., pp. 1\u201314 (2020)","DOI":"10.1080\/10556788.2020.1843167"},{"issue":"1","key":"1448_CR28","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1137\/080743573","volume":"21","author":"Y Narushima","year":"2011","unstructured":"Narushima, Y., Yabe, H., Ford, J.: A three-term conjugate gradient method with sufficient descent property for unconstrained optimization. SIAM J. Optim. 21(1), 212\u2013230 (2011)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1448_CR29","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1080\/10556780701223293","volume":"22","author":"L Zhang","year":"2007","unstructured":"Zhang, L., Zhou, W., Li, D.: Some descent three-term conjugate gradient methods and their global convergence. Optim. Methods Softw. 22(4), 697\u2013711 (2007)","journal-title":"Optim. Methods Softw."},{"key":"1448_CR30","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.cam.2012.10.002","volume":"241","author":"N Andrei","year":"2013","unstructured":"Andrei, N.: A simple three-term conjugate gradient algorithm for unconstrained optimization. J. Comput. Appl. Math. 241, 19\u201329 (2013)","journal-title":"J. Comput. Appl. Math."},{"key":"1448_CR31","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/j.apnum.2019.12.026","volume":"151","author":"S Yao","year":"2020","unstructured":"Yao, S., Feng, Q., Li, L., Xu, J.: A class of globally convergent three-term Dai-Liao conjugate gradient methods. Appl. Numer. Math. 151, 354\u2013366 (2020)","journal-title":"Appl. Numer. Math."},{"issue":"12","key":"1448_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3390\/math9121353","volume":"9","author":"Q Tian","year":"2021","unstructured":"Tian, Q., Wang, X.L., Pang, L.P., Zhang, M.K., Meng, F.Y.: A new hybrid three-term conjugate gradient algorithm for large-scale unconstrained problems. Mathematics 9(12), 1\u201316 (2021)","journal-title":"Mathematics"},{"key":"1448_CR33","doi-asserted-by":"crossref","unstructured":"Andrei, N.: Nonlinear conjugate gradient methods for unconstrained optimization. Springer Optim. Appl., vol. 158 (2020)","DOI":"10.1007\/978-3-030-42950-8"},{"issue":"2","key":"1448_CR34","first-page":"1156","volume":"175","author":"Z Wei","year":"2006","unstructured":"Wei, Z., Li, G., Qi, L.: New quasi-newton methods for unconstrained optimization problems. Appl. Math. Comput. 175(2), 1156\u20131188 (2006)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"1448_CR35","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s10589-008-9219-0","volume":"47","author":"G Yuan","year":"2010","unstructured":"Yuan, G., Wei, Z.: Convergence analysis of a modified BFGS method on convex minimizations. Comput. Optim. Appl. 47(2), 237\u2013255 (2010)","journal-title":"Comput. Optim. Appl."},{"issue":"1-2","key":"1448_CR36","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0377-0427(00)00540-9","volume":"129","author":"D Li","year":"2001","unstructured":"Li, D., Fukushima, M.: A modified BFGS method and its global convergence in nonconvex minimization. J. Comput. Appl. Math. 129(1-2), 15\u201335 (2001)","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"1448_CR37","first-page":"465","volume":"21","author":"S Babaie-Kafaki","year":"2014","unstructured":"Babaie-Kafaki, S., Ghanbari, R.: A modified scaled conjugate gradient method with global convergence for nonconvex functions. Bullet. Belgian Math. Society Simon Stevin 21(3), 465\u2013477 (2014)","journal-title":"Bullet. Belgian Math. Society Simon Stevin"},{"issue":"1","key":"1448_CR38","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s11075-006-9023-9","volume":"42","author":"N Andrei","year":"2006","unstructured":"Andrei, N.: An acceleration of gradient descent algorithm with backtracking for unconstrained optimization. Numer. Alg. 42(1), 63\u201373 (2006)","journal-title":"Numer. Alg."},{"issue":"1","key":"1448_CR39","first-page":"147","volume":"10","author":"N Andrei","year":"2008","unstructured":"Andrei, N.: An unconstrained optimization test functions collection. Adv. Model. Optim. 10(1), 147\u2013161 (2008)","journal-title":"Adv. Model. Optim."},{"issue":"2","key":"1448_CR40","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(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"1448_CR41","doi-asserted-by":"crossref","DOI":"10.1002\/0471249718","volume-title":"Fundamentals of matrix computations","author":"S Watkins","year":"2002","unstructured":"Watkins, S.: Fundamentals of matrix computations. Wiley, New York (2002)"},{"issue":"8","key":"1448_CR42","doi-asserted-by":"crossref","first-page":"1595","DOI":"10.1080\/00207160.2018.1465940","volume":"96","author":"S Babaie-Kafaki","year":"2019","unstructured":"Babaie-Kafaki, S.: A hybrid scaling parameter for the scaled memoryless BFGS method based on the $\\ell _{\\infty }$ matrix norm. Int. J. Comput. Math. 96(8), 1595\u20131602 (2019)","journal-title":"Int. J. Comput. Math."},{"issue":"5","key":"1448_CR43","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1016\/j.aml.2010.01.010","volume":"23","author":"G Yu","year":"2010","unstructured":"Yu, G., Huang, J., Zhou, Y.: A descent spectral conjugate gradient method for impulse noise removal. Appl. Math. Lett. 23(5), 555\u2013560 (2010)","journal-title":"Appl. Math. Lett."},{"issue":"1","key":"1448_CR44","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10851-007-0027-4","volume":"29","author":"J Cai","year":"2007","unstructured":"Cai, J., Chan, R., Fiore, C.: Minimization of a detail-preserving regularization functional for impulse noise removal. J. Math. Imaging Vis. 29(1), 79\u201391 (2007)","journal-title":"J. Math. Imaging Vis."},{"key":"1448_CR45","unstructured":"Bovik, A.: Handbook of image and video processing, academic, New York (2000)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01448-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-022-01448-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-022-01448-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T08:21:37Z","timestamp":1686126097000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-022-01448-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,12]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["1448"],"URL":"https:\/\/doi.org\/10.1007\/s11075-022-01448-y","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,12]]},"assertion":[{"value":"26 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of interest"}}]}}