{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T02:12:19Z","timestamp":1784340739114,"version":"3.55.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T00:00:00Z","timestamp":1710460800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T00:00:00Z","timestamp":1710460800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61967004"],"award-info":[{"award-number":["61967004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11901137"],"award-info":[{"award-number":["11901137"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangxi Key Laboratory of Cryptography and Information Security","award":["GCIS201927"],"award-info":[{"award-number":["GCIS201927"]}]},{"name":"Guangxi Key Laboratory of Automatic Detecting Technology and Instruments","award":["YQ20113"],"award-info":[{"award-number":["YQ20113"]}]},{"name":"Innovation Project of GUET Graduate Education","award":["2023YCXS113"],"award-info":[{"award-number":["2023YCXS113"]}]},{"name":"Innovation Project of Guangxi Graduate Education","award":["2021YCXS118"],"award-info":[{"award-number":["2021YCXS118"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s40314-023-02521-5","type":"journal-article","created":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T07:01:26Z","timestamp":1710486086000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An accelerated conjugate gradient method with adaptive two-parameter with applications in image restoration"],"prefix":"10.1007","volume":"43","author":[{"given":"Zhibin","family":"Zhu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8672-1367","authenticated-orcid":false,"given":"Xiaowen","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhen","family":"Tan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,3,15]]},"reference":[{"issue":"3","key":"2521_CR1","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10589-007-9055-7","volume":"38","author":"N Andrei","year":"2007","unstructured":"Andrei N (2007) Scaled conjugate gradient algorithms for unconstrained optimization. Comput Optim Appl 38(3):401\u2013416","journal-title":"Comput Optim Appl"},{"issue":"1","key":"2521_CR2","first-page":"147","volume":"10","author":"N Andrei","year":"2008","unstructured":"Andrei N (2008) An unconstrained optimization test functions collection. Adv Model Optim 10(1):147\u2013161","journal-title":"Adv Model Optim"},{"issue":"2","key":"2521_CR3","first-page":"361","volume":"213","author":"N Andrei","year":"2009","unstructured":"Andrei N (2009) Acceleration of conjugate gradient algorithms for unconstrained optimization. Appl Math Comput 213(2):361\u2013369","journal-title":"Appl Math Comput"},{"key":"2521_CR4","first-page":"6316","volume":"219","author":"N Andrei","year":"2013","unstructured":"Andrei N (2013) On three-term conjugate gradient algorithms for unconstrained optimization. Appl Math Comput 219:6316\u20136327","journal-title":"Appl Math Comput"},{"key":"2521_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.cam.2017.04.045","volume":"325","author":"N Andrei","year":"2017","unstructured":"Andrei N (2017) Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update. J Comput Appl Math 325:149\u2013164","journal-title":"J Comput Appl Math"},{"key":"2521_CR6","volume-title":"Handbook of image and video processing","author":"AC Bovik","year":"2010","unstructured":"Bovik AC (2010) Handbook of image and video processing. Academic Press, New York"},{"key":"2521_CR7","doi-asserted-by":"crossref","unstructured":"Cai JF, Chan R, Morini B (2007a) Minimization of an edge-preserving regularization functional by conjugate gradient type methods. In: Image Processing based on partial differential equations. Springer, Berlin, Heidelberg, pp 109\u2013122","DOI":"10.1007\/978-3-540-33267-1_7"},{"key":"2521_CR8","doi-asserted-by":"crossref","unstructured":"Cai JF, Chan RH, Fiore CD (2007b) Minimization of a detail-preserving regularization functional for impulse noise removal. J Math Imaging Vis 27:79\u201391","DOI":"10.1007\/s10851-007-0027-4"},{"issue":"10","key":"2521_CR9","doi-asserted-by":"publisher","first-page":"1479","DOI":"10.1109\/TIP.2005.852196","volume":"14","author":"RH Chan","year":"2005","unstructured":"Chan RH, Ho CW, Nikolova M (2005) Salt-and-pepper noise removal by median-type noise detectors and detail-preserving regularization. IEEE Trans Image Process 14(10):1479\u20131485","journal-title":"IEEE Trans Image Process"},{"key":"2521_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13660-019-2238-9","volume":"1","author":"Y Chen","year":"2019","unstructured":"Chen Y, Cao M, Yang Y (2019) A new accelerated conjugate gradient method for large-scale unconstrained optimization. J Inequal Appl 1:1\u201313. https:\/\/doi.org\/10.1186\/s13660-019-2238-9","journal-title":"J Inequal Appl"},{"key":"2521_CR11","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s002450010019","volume":"43","author":"YH Dai","year":"2001","unstructured":"Dai YH, Liao LZ (2001) New conjugacy conditions and related nonlinear conjugate gradient methods. Appl Math Optim 43:87\u2013101","journal-title":"Appl Math Optim"},{"issue":"1","key":"2521_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"YH Dai","year":"1999","unstructured":"Dai YH, Yuan Y (1999) A nonlinear conjugate gradient method with a strong global convergence property. SIAM J Optim 10(1):177\u2013182","journal-title":"SIAM J Optim"},{"key":"2521_CR13","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.apnum.2015.01.008","volume":"92","author":"SH Deng","year":"2015","unstructured":"Deng SH, Wan Z (2015) A three-term conjugate gradient algorithm for large-scale unconstrained optimization problems. Appl Numer Math 92:70\u201381","journal-title":"Appl Numer Math"},{"issue":"2","key":"2521_CR14","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan ED, Mor\u00e9 JJ (2002) Benchmarking optimization software with performance profiles. Math Progr 91(2):201\u2013213","journal-title":"Math Progr"},{"key":"2521_CR15","volume-title":"Practical method of optimization, Vol I: unconstrained optimization","author":"R Fletcher","year":"1987","unstructured":"Fletcher R (1987) Practical method of optimization, Vol I: unconstrained optimization. Wiley, New York"},{"key":"2521_CR16","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"R Fletcher","year":"1964","unstructured":"Fletcher R, Reeves CM (1964) Function minimization by conjugate gradients. Comput J 7:149\u2013154","journal-title":"Comput J"},{"key":"2521_CR17","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/030601880","volume":"16","author":"WW Hager","year":"2005","unstructured":"Hager WW, Zhang H (2005) A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J Optim 16:170\u2013192","journal-title":"SIAM J Optim"},{"key":"2521_CR18","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/1132973.1132979","volume":"32","author":"WW Hager","year":"2006","unstructured":"Hager WW, Zhang H (2006) Algorithm 851: CG_DESCENT, a conjugate gradient method with guaranteed descent. ACM Trans Math Softw 32:113\u2013137","journal-title":"ACM Trans Math Softw"},{"key":"2521_CR19","doi-asserted-by":"publisher","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"MR Hestenes","year":"1952","unstructured":"Hestenes MR, Stiefel E (1952) Method of conjugate gradient for solving linear equations. J Res Natl Bureau Stand 49:409\u2013436","journal-title":"J Res Natl Bureau Stand"},{"key":"2521_CR20","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s11075-022-01258-2","volume":"91","author":"XZ Jiang","year":"2022","unstructured":"Jiang XZ, Liao W, Yin JH, Jian JB (2022) A new family of hybrid three-term conjugate gradient methods with applications in image restoration. Numer Algorithms 91:161\u2013191","journal-title":"Numer Algorithms"},{"key":"2521_CR21","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF00940464","volume":"69","author":"Y Liu","year":"1991","unstructured":"Liu Y, Storey C (1991) Efficient generalized conjugate gradient algorithms, part 1: theory. J Optim Theory Appl 69:129\u2013137","journal-title":"J Optim Theory Appl"},{"key":"2521_CR22","doi-asserted-by":"publisher","first-page":"1787","DOI":"10.1007\/s12190-021-01589-8","volume":"68","author":"YF Liu","year":"2022","unstructured":"Liu YF, Zhu ZB, Zhang BX (2022) Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing. J Appl Math Comput 68:1787\u20131816. https:\/\/doi.org\/10.1007\/s12190-021-01589-8","journal-title":"J Appl Math Comput"},{"key":"2521_CR23","volume-title":"Numerical optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal J, Wright SJ (2006) Numerical optimization. Springer Science+Business Media, New York"},{"key":"2521_CR24","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1287\/mnsc.20.5.863","volume":"20","author":"SS Oren","year":"1974","unstructured":"Oren SS (1974) Self-scaling variable metric (SSVM) algorithms, II: implementation and experiments. Manag Sci 20:863\u2013874","journal-title":"Manag Sci"},{"key":"2521_CR25","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1287\/opre.26.6.1073","volume":"26","author":"A Perry","year":"1978","unstructured":"Perry A (1978) Technical note\u2014a modified conjugate gradient algorithm. Oper Res 26:1073\u20131078","journal-title":"Oper Res"},{"issue":"16","key":"2521_CR26","first-page":"35","volume":"3","author":"E Polak","year":"1969","unstructured":"Polak E, Ribi\u00e8re G (1969) Note sur la convergence de m\u00e9thodes de directions conjugu\u00e9es. Rev Fran\u015faise Inf Rech Oper 3(16):35\u201343","journal-title":"Rev Fran\u015faise Inf Rech Oper"},{"issue":"4","key":"2521_CR27","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","volume":"9","author":"BT Polyak","year":"1969","unstructured":"Polyak BT (1969) The conjugate gradient method in extreme problems. USSR Comput Math Math Phys 9(4):94\u2013112","journal-title":"USSR Comput Math Math Phys"},{"key":"2521_CR28","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF01593790","volume":"12","author":"MJD Powell","year":"1977","unstructured":"Powell MJD (1977) Restart procedures of the conjugate gradient method. Math Progr 12:241\u2013254","journal-title":"Math Progr"},{"key":"2521_CR29","volume-title":"Optimization theory and methods: nonlinear programming","author":"W Sun","year":"2006","unstructured":"Sun W, Yuan Y (2006) Optimization theory and methods: nonlinear programming. Springer Science+Business Media, New York"},{"issue":"2","key":"2521_CR30","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1137\/1011036","volume":"11","author":"P Wolfe","year":"1968","unstructured":"Wolfe P (1968) Convergence conditions for ascent methods. SIAM Rev 11(2):226\u2013235","journal-title":"SIAM Rev"},{"issue":"2","key":"2521_CR31","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1137\/1013035","volume":"13","author":"P Wolfe","year":"1971","unstructured":"Wolfe P (1971) Convergence conditions for ascent methods, (II): some corrections. SIAM Rev 13(2):185\u2013188","journal-title":"SIAM Rev"},{"key":"2521_CR32","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.cam.2017.10.013","volume":"322","author":"SW Yao","year":"2018","unstructured":"Yao SW, Ning LS (2018) An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix. J Comput Appl Math 322:72\u201385","journal-title":"J Comput Appl Math"},{"key":"2521_CR33","unstructured":"Zoutendijk G (1970) Nonlinear programming, computational methods. In: Abadie J (ed) Integer and nonlinear programming. North-Holland, Amsterdam, pp 37\u201386"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-023-02521-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-023-02521-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-023-02521-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T05:16:35Z","timestamp":1712553395000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-023-02521-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,15]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["2521"],"URL":"https:\/\/doi.org\/10.1007\/s40314-023-02521-5","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,15]]},"assertion":[{"value":"25 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2024","order":4,"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 to have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"116"}}