{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:20:38Z","timestamp":1740108038351,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,8,13]],"date-time":"2021-08-13T00:00:00Z","timestamp":1628812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,13]],"date-time":"2021-08-13T00:00:00Z","timestamp":1628812800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11661009"],"award-info":[{"award-number":["11661009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the High Level Innovation Teams and Excellent Scholars Program in Guangxi institutions of higher education","award":["[2019]52"],"award-info":[{"award-number":["[2019]52"]}]},{"name":"the Guangxi Natural Science Key Fund","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"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s00521-021-06383-y","type":"journal-article","created":{"date-parts":[[2021,8,13]],"date-time":"2021-08-13T19:02:25Z","timestamp":1628881345000},"page":"535-553","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A conjugate gradient algorithm based on double parameter scaled Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno update for optimization problems and image restoration"],"prefix":"10.1007","volume":"34","author":[{"given":"Dan","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junyu","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gonglin","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,13]]},"reference":[{"key":"6383_CR1","first-page":"108","volume":"1","author":"AY Al-Bayati","year":"2010","unstructured":"Al-Bayati AY, Sharif WH (2010) A new three-term conjugate gradient method for unconstrained optimization. Can J Sci Eng Math 1:108\u2013124","journal-title":"Can J Sci Eng Math"},{"key":"6383_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s11075-018-0541-z","volume":"81","author":"AB Abubakar","year":"2019","unstructured":"Abubakar AB, Kumam P (2019) A descent Dai-Liao conjugate gradient method for nonlinear equations. Numer Algo 81:197\u2013210","journal-title":"Numer Algo"},{"key":"6383_CR3","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1016\/j.apnum.2019.05.012","volume":"145","author":"AM Awwal","year":"2019","unstructured":"Awwal AM, Kumam Poom, Abubakar Auwal Bala (2019) A modified conjugate gradient method for monotone nonlinear equations with convex constraints. Appl Numer Math 145:507\u2013520","journal-title":"Appl Numer Math"},{"key":"6383_CR4","doi-asserted-by":"crossref","first-page":"6316","DOI":"10.1016\/j.amc.2012.11.097","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":"6383_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":"6383_CR6","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.cam.2017.10.009","volume":"332","author":"N Andrei","year":"2018","unstructured":"Andrei N (2018) A double parameter scaled bfgs method for unconstrained optimization. J Comput Appl Math 332:26\u201344","journal-title":"J Comput Appl Math"},{"key":"6383_CR7","first-page":"83","volume":"29","author":"S Babaie-Kafaki","year":"2014","unstructured":"Babaie-Kafaki S, Ghanbari R (2014) A descent family of daiCliao conjugate gradient methods. Opt Methods Softw 29:83\u2013591","journal-title":"Opt Methods Softw"},{"key":"6383_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s00245-001-0003-0","volume":"43","author":"EG Birgin","year":"2001","unstructured":"Birgin EG, Martinez JM (2001) A spectral conjugate gradient method for unconstrained optimization. Appl Math Opt 43:117\u2013128","journal-title":"Appl Math Opt"},{"key":"6383_CR9","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1093\/imamat\/6.3.222","volume":"6","author":"CG Broyden","year":"1970","unstructured":"Broyden CG (1970) The convergence of a class of double rank minimization algorithms: 2. The new algorithm. J Inst Math Appl 6:222\u2013231","journal-title":"J Inst Math Appl"},{"key":"6383_CR10","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1137\/0709024","volume":"9","author":"A Cohen","year":"1972","unstructured":"Cohen A (1972) Rate of convergence of several conjugate gradient algorithms. SIAM J Numer Anal 9:248\u2013259","journal-title":"SIAM J Numer Anal"},{"key":"6383_CR11","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 Prog 91:201\u2013213","journal-title":"Math Prog"},{"key":"6383_CR12","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s002450010019","volume":"43","author":"Y Dai","year":"2001","unstructured":"Dai Y, Liao L (2001) New conjugacy conditions and relatednon linear conjugate gradient methods. Appl Math Opt 43:87\u2013101","journal-title":"Appl Math Opt"},{"key":"6383_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"Y Dai","year":"1999","unstructured":"Dai Y, Yuan Y (1999) A nonlinear conjugate gradient with a strong global convergence property. SIAM J Opt 10:177\u2013182","journal-title":"SIAM J Opt"},{"key":"6383_CR14","doi-asserted-by":"publisher","first-page":"2309","DOI":"10.1080\/02331934.2017.1372438","volume":"66","author":"Y Ding","year":"2017","unstructured":"Ding Y, Xiao Y, Li J (2017) A class of conjugate gradient methods for convex constrained monotone equations. Optimization 66:2309\u20132328","journal-title":"Optimization"},{"key":"6383_CR15","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1186\/s13660-017-1510-0","volume":"2017","author":"D Feng","year":"2017","unstructured":"Feng D, Sun M, Wang X (2017) A family of conjugate gradient methods for large-scale nonlinear equations. J Inequal Appl 2017:236","journal-title":"J Inequal Appl"},{"key":"6383_CR16","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1093\/comjnl\/13.3.317","volume":"13","author":"R Fletcher","year":"1970","unstructured":"Fletcher R (1970) A new approach to variable metric algorithms. Comput J 13:317\u2013322","journal-title":"Comput J"},{"key":"6383_CR17","unstructured":"Fletcher R (1997) Practical method of optimization, vol I: unconstrained optimization. Wiley, New York"},{"key":"6383_CR18","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. J Comput 7:149\u2013154","journal-title":"J Comput"},{"key":"6383_CR19","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1061\/(ASCE)0733-9437(2006)132:5(474)","volume":"132","author":"ZW Geem","year":"2006","unstructured":"Geem ZW (2006) Parameter estimation for the nonlinear Muskingum model using the BFGS technique. J Irrig Drain Eng 132:474\u2013478","journal-title":"J Irrig Drain Eng"},{"key":"6383_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1090\/S0025-5718-1970-0258249-6","volume":"24","author":"A Goldfarb","year":"1970","unstructured":"Goldfarb A (1970) A family of variable metric methods derived by variational means. Math Comp 24:23\u201326","journal-title":"Math Comp"},{"key":"6383_CR21","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 National Bureau Stand 49:409\u2013436","journal-title":"J Res National Bureau Stand"},{"key":"6383_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40314-019-0973-7","volume":"38","author":"Z Khoshgam","year":"2019","unstructured":"Khoshgam Z, Ashrafi A (2019) A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function. Comput Appl Math 38:1\u201314","journal-title":"Comput Appl Math"},{"key":"6383_CR23","doi-asserted-by":"publisher","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 (2007) New conjugacy condition and related new conjugate gradient methods for unconstrained optimization. J Comput Appl Math 202:523\u2013539","journal-title":"J Comput Appl Math"},{"key":"6383_CR24","first-page":"177","volume":"10","author":"Y Liu","year":"2000","unstructured":"Liu Y, Storey C (2000) Effcient generalized conjugate gradient algorithms part 1: theory. J comput Appl Math 10:177\u2013182","journal-title":"J comput Appl Math"},{"key":"6383_CR25","doi-asserted-by":"crossref","unstructured":"Ouyang A, Liu L, Sheng Z, Wu F (2015) A class of parameter estimation methods for nonlinear Muskingum model using hybrid invasive weed optimization algorithm. Math Prob Eng , 2015, Article ID 573894","DOI":"10.1155\/2015\/573894"},{"key":"6383_CR26","doi-asserted-by":"crossref","unstructured":"Ouyang A, Tang Z, Li K, Sallam A, Sha E (2014) Estimating parameters of Muskingum model using an adaptive hybrid PSO algorithm. Int J Pattern Recog Artif Intell . Recogn, 28, Article ID 1459003","DOI":"10.1142\/S0218001414590034"},{"key":"6383_CR27","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 a modified conjugate gradient algorithm. Oper Res 26:1073\u20131078","journal-title":"Oper Res"},{"key":"6383_CR28","unstructured":"Perry J et al A class of conjugate gradient algorithms with a two-step variable metric memory. In: Discussion Papers 269"},{"key":"6383_CR29","doi-asserted-by":"crossref","unstructured":"Polak E, Ribi\u00e9re G (1969) Note Surl\u00e1 convergence de directions conjug\u00e9es, Rev. Francaise Informat Recherche Operationelle. 3e Anne, 16:35\u201343","DOI":"10.1051\/m2an\/196903R100351"},{"key":"6383_CR30","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:94\u2013112","journal-title":"USSR Comput Math Math Phys"},{"key":"6383_CR31","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1090\/S0025-5718-1970-0274029-X","volume":"24","author":"J Schanno","year":"1970","unstructured":"Schanno J (1970) Conditions of quasi-Newton methods for function minimization. Math Comp 24:647\u2013650","journal-title":"Math Comp"},{"key":"6383_CR32","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1287\/moor.3.3.244","volume":"3","author":"D Shanno","year":"1978","unstructured":"Shanno D (1978) Conjugate gradient methods with inexact line searches. Math Oper Res 3:244\u2013256","journal-title":"Math Oper Res"},{"key":"6383_CR33","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1137\/0715085","volume":"15","author":"D Shanno","year":"1978","unstructured":"Shanno D (1978) On the convergence of a new conjugate gradient algorithm. SIAM J Numer Anal 15:1247\u20131257","journal-title":"SIAM J Numer Anal"},{"key":"6383_CR34","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/s10957-011-9960-x","volume":"153","author":"K Sugiki","year":"2012","unstructured":"Sugiki K, Narushima Y, Yabe H (2012) Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization. J Opt Theory Appl 153:733\u2013757","journal-title":"J Opt Theory Appl"},{"key":"6383_CR35","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1137\/1011036","volume":"13","author":"P Wolfe","year":"1969","unstructured":"Wolfe P (1969) Convergence conditions for ascent methods ii: Some corrections. SIAM Rev 13:226\u2013235","journal-title":"SIAM Rev"},{"key":"6383_CR36","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.cam.2017.10.013","volume":"332","author":"S Yao","year":"2018","unstructured":"Yao S, Ning L (2018) An adaptive three-term conjugate gradient method based on self-scaling memoryless bfgs matrix. J Comput Appl Math 332:2\u201385","journal-title":"J Comput Appl Math"},{"key":"6383_CR37","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.apnum.2019.08.022","volume":"147","author":"G Yuan","year":"2020","unstructured":"Yuan G, Li T, Hu W (2020) A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems. Appl Numer Math 147:129\u2013141","journal-title":"Appl Numer Math"},{"key":"6383_CR38","doi-asserted-by":"publisher","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 (2020) 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","journal-title":"Appl Numer Math"},{"key":"6383_CR39","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/j.cam.2017.05.030","volume":"327","author":"G Yuan","year":"2018","unstructured":"Yuan G, Sheng Z, Wang B, Hu W, Li C (2018) The global convergence of a modified BFGS method for nonconvex functions. J Comput Appl Math 327:274\u2013294","journal-title":"J Comput Appl Math"},{"key":"6383_CR40","first-page":"811","volume":"47","author":"G Yuan","year":"2017","unstructured":"Yuan G, Wei Z, Lu X (2017) Global convergence of the BFGS method and the PRP method for general functions under a modified weak Wolfe-Powell line search. Appl Math Opt 47:811\u2013825","journal-title":"Appl Math Opt"},{"key":"6383_CR41","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/j.cam.2018.10.057","volume":"362","author":"G Yuan","year":"2019","unstructured":"Yuan G, Wei Z, Yang Y (2019) The global convergence of the Polak-Ribi\u00e9re-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions. J Comput Appl Math 362:262\u2013275","journal-title":"J Comput Appl Math"},{"key":"6383_CR42","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1080\/10556789308805532","volume":"2","author":"Y Yuan","year":"1993","unstructured":"Yuan Y (1993) Analysis on the conjugate gradient method. Opt Math Softw 2:19\u201329","journal-title":"Opt Math Softw"},{"key":"6383_CR43","volume-title":"Theory and methods of optimization","author":"Y Yuan","year":"1999","unstructured":"Yuan Y, Sun W (1999) Theory and methods of optimization. Science Press of China, Beijing"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-06383-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-021-06383-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-06383-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T10:45:05Z","timestamp":1699353905000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-021-06383-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,13]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["6383"],"URL":"https:\/\/doi.org\/10.1007\/s00521-021-06383-y","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2021,8,13]]},"assertion":[{"value":"5 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that there are no conflicts of interest regarding the publication of this paper","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}