{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T02:48:45Z","timestamp":1770691725669,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,10,5]],"date-time":"2023-10-05T00:00:00Z","timestamp":1696464000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,5]],"date-time":"2023-10-05T00:00:00Z","timestamp":1696464000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s12190-023-01918-z","type":"journal-article","created":{"date-parts":[[2023,10,5]],"date-time":"2023-10-05T17:02:09Z","timestamp":1696525329000},"page":"4213-4228","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Some improved Dai\u2013Yuan conjugate gradient methods for large-scale unconstrained optimization problems"],"prefix":"10.1007","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0120-7500","authenticated-orcid":false,"given":"S.","family":"Bojari","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8272-857X","authenticated-orcid":false,"given":"M. R.","family":"Eslahchi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,5]]},"reference":[{"issue":"6","key":"1918_CR1","doi-asserted-by":"publisher","first-page":"409","DOI":"10.6028\/JRES.049.044","volume":"49","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Stand. 49(6), 409\u2013435 (1952). https:\/\/doi.org\/10.6028\/JRES.049.044","journal-title":"J. Res. Nat. Bur. Stand."},{"issue":"2","key":"1918_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"R Fletcher","year":"1962","unstructured":"Fletcher, R., Reeves, C.: Function minimization by conjugate gradients. Comput. J. 7(2), 149\u2013154 (1962). https:\/\/doi.org\/10.1093\/comjnl\/7.2.149","journal-title":"Comput. J."},{"issue":"R1","key":"1918_CR3","first-page":"35","volume":"3","author":"E Polak","year":"1969","unstructured":"Polak, E., Ribi\u00e9re, G.: Note sur la convergence de m\u00e9thodes de directions conjugu\u00e9es. Francaise Informat. Recherche Opertionelle, 3e ann\u00e9e 3(R1), 35\u201343 (1969)","journal-title":"Francaise Informat. Recherche Opertionelle, 3e ann\u00e9e"},{"issue":"4","key":"1918_CR4","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1016\/0041-5553(69)90035-4","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"1","key":"1918_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"YH Dai","year":"1999","unstructured":"Dai, Y.H., Yuan, Y.: A nonlinear conjugate gradient method with a strong global convergence property. SIAM J. Optim. 10(1), 177\u2013182 (1999). https:\/\/doi.org\/10.1137\/S1052623497318992","journal-title":"SIAM J. Optim."},{"issue":"8","key":"1918_CR6","doi-asserted-by":"publisher","first-page":"1911","DOI":"10.1007\/s11590-017-1205-y","volume":"12","author":"M Li","year":"2018","unstructured":"Li, M.: A family of three-term nonlinear conjugate gradient methods close to the memoryless BFGS method. Optim. Lett. 12(8), 1911\u20131927 (2018). https:\/\/doi.org\/10.1007\/s11590-017-1205-y","journal-title":"Optim. Lett."},{"issue":"2","key":"1918_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10092-018-0258-3","volume":"55","author":"JK Liu","year":"2018","unstructured":"Liu, J.K., Feng, Y.M., Zou, L.M.: Some three-term conjugate gradient methods with the inexact line search condition. Calcolo 55(2), 1\u201316 (2018). https:\/\/doi.org\/10.1007\/s10092-018-0258-3","journal-title":"Calcolo"},{"issue":"8","key":"1918_CR8","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.1007\/s11590-015-0979-z","volume":"10","author":"IE Livieris","year":"2016","unstructured":"Livieris, I.E., Pintelas, P.: A limited memory descent Perry conjugate gradient method. Optim. Lett. 10(8), 1725\u20131742 (2016). https:\/\/doi.org\/10.1007\/s11590-015-0979-z","journal-title":"Optim. Lett."},{"issue":"1","key":"1918_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13660-017-1373-4","volume":"97","author":"Y Wu","year":"2017","unstructured":"Wu, Y.: A modified three-term PRP conjugate gradient algorithm for optimization models. J. Inequal. Appl. 97(1), 1\u201314 (2017). https:\/\/doi.org\/10.1186\/s13660-017-1373-4","journal-title":"J. Inequal. Appl."},{"issue":"1","key":"1918_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s11590-015-0865-8","volume":"10","author":"Y Zhang","year":"2016","unstructured":"Zhang, Y., Dan, B.: An efficient adaptive scaling parameter for the spectral conjugate gradient method. Optim. Lett. 10(1), 119\u2013136 (2016). https:\/\/doi.org\/10.1007\/s11590-015-0865-8","journal-title":"Optim. Lett."},{"issue":"1","key":"1918_CR11","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/j.cam.2018.09.012","volume":"348","author":"XZ Jiang","year":"2019","unstructured":"Jiang, X.Z., Jian, J.B.: Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search. J. Comput. Appl. Math. 348(1), 525\u2013534 (2019). https:\/\/doi.org\/10.1016\/j.cam.2018.09.012","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"1918_CR12","doi-asserted-by":"publisher","first-page":"125004","DOI":"10.1016\/j.amc.2019.125004","volume":"373","author":"Z Zhu","year":"2020","unstructured":"Zhu, Z., Zhang, D., Wang, S.: Two modified DY conjugate gradient methods for unconstrained optimization problems. Appl. Math. Comput. 373(1), 125004 (2020). https:\/\/doi.org\/10.1016\/j.amc.2019.125004","journal-title":"Appl. Math. Comput."},{"issue":"6","key":"1918_CR13","doi-asserted-by":"publisher","first-page":"6506","DOI":"10.1016\/j.amc.2015.08.014","volume":"6","author":"AB Abubakar","year":"2021","unstructured":"Abubakar, A.B., Kumam, P., Malik, M., Chaipunya, P., Ibrahim, A.S.: A hybrid FR\u2013DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection. AIMS Math. 6(6), 6506\u20136527 (2021). https:\/\/doi.org\/10.1016\/j.amc.2015.08.014","journal-title":"AIMS Math."},{"issue":"1","key":"1918_CR14","doi-asserted-by":"publisher","first-page":"113823","DOI":"10.1016\/j.cam.2021.113823","volume":"405","author":"J Deepho","year":"2022","unstructured":"Deepho, J., Abubakar, A.B., Malik, M., Argyros, I.K.: Solving unconstrained optimization problems via hybrid CD\u2013DY conjugate gradient methods with applications. J. Comput. Appl. Math. 405(1), 113823 (2022). https:\/\/doi.org\/10.1016\/j.cam.2021.113823","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"1918_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10915-021-01713-7","volume":"90","author":"MY Waziri","year":"2022","unstructured":"Waziri, M.Y., Ahmed, K.: Two descent Dai\u2013Yuan conjugate gradient methods for systems of monotone nonlinear equations. J. Sci. Comput. 90(1), 1\u201353 (2022). https:\/\/doi.org\/10.1007\/s10915-021-01713-7","journal-title":"J. Sci. Comput."},{"issue":"2","key":"1918_CR16","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.aml.2007.05.002","volume":"21","author":"N Andrei","year":"2008","unstructured":"Andrei, N.: A Dai\u2013Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization. Appl. Math. Lett. 21(2), 165\u2013171 (2008). https:\/\/doi.org\/10.1016\/j.aml.2007.05.002","journal-title":"Appl. Math. Lett."},{"issue":"3","key":"1918_CR17","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1142\/S0217595908001663","volume":"25","author":"H Zhu","year":"2008","unstructured":"Zhu, H., Chen, X.: Global convergence of a special case of the Dai\u2013Yuan family without line search. Asia-Pac. J. Oper. Res. 25(3), 411\u2013420 (2008). https:\/\/doi.org\/10.1142\/S0217595908001663","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"1","key":"1918_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11075-008-9213-8","volume":"50","author":"L Zhang","year":"2009","unstructured":"Zhang, L.: Two modified Dai\u2013Yuan nonlinear conjugate gradient methods. Numer. Algorithms 50(1), 1\u201316 (2009). https:\/\/doi.org\/10.1007\/s11075-008-9213-8","journal-title":"Numer. Algorithms"},{"issue":"1","key":"1918_CR19","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s11071-012-0694-6","volume":"72","author":"XZ Jiang","year":"2013","unstructured":"Jiang, X.Z., Jian, J.B.: A sufficient descent Dai\u2013Yuan type nonlinear conjugate gradient method for unconstrained optimization problems. Nonlinear Dyn. 72(1), 101\u2013112 (2013). https:\/\/doi.org\/10.1007\/s11071-012-0694-6","journal-title":"Nonlinear Dyn."},{"issue":"4","key":"1918_CR20","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1080\/10556788.2014.966825","volume":"30","author":"S Babaie-Kafaki","year":"2015","unstructured":"Babaie-Kafaki, S., Ghanbari, R.: A hybridization of the Hestenes\u2013Stiefel and Dai\u2013Yuan conjugate gradient methods based on a least-squares approach. Optim. Methods Softw. 30(4), 673\u2013681 (2015). https:\/\/doi.org\/10.1080\/10556788.2014.966825","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"1918_CR21","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1093\/imanum\/11.3.325","volume":"11","author":"YX Yuan","year":"1991","unstructured":"Yuan, Y.X.: A modified BFGS algorithm for unconstrained optimization. IMA J. Numer. Anal. 11(3), 325\u2013332 (1991). https:\/\/doi.org\/10.1093\/imanum\/11.3.325","journal-title":"IMA J. Numer. Anal."},{"issue":"2","key":"1918_CR22","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1016\/j.amc.2005.08.027","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). https:\/\/doi.org\/10.1016\/j.amc.2005.08.027","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"1918_CR23","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1021898630001","volume":"102","author":"JZ Zhang","year":"1999","unstructured":"Zhang, J.Z., Deng, N.Y., Chen, L.H.: New quasi-Newton equation and related methods for unconstrained optimization. J. Optim. Theory Appl. 102(1), 147\u2013167 (1999). https:\/\/doi.org\/10.1023\/A:1021898630001","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1918_CR24","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0377-0427(00)00713-5","volume":"137","author":"J Zhang","year":"2001","unstructured":"Zhang, J., Xu, C.: Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations. J. Comput. Appl. Math. 137(2), 269\u2013278 (2001). https:\/\/doi.org\/10.1016\/S0377-0427(00)00713-5","journal-title":"J. Comput. Appl. Math."},{"issue":"8","key":"1918_CR25","doi-asserted-by":"publisher","first-page":"2412","DOI":"10.1016\/j.cam.2010.10.041","volume":"235","author":"F Biglari","year":"2011","unstructured":"Biglari, F., Hassan, M.A., Leong, W.J.: New quasi-Newton methods via higher order tensor models. J. Comput. Appl. Math. 235(8), 2412\u20132422 (2011). https:\/\/doi.org\/10.1016\/j.cam.2010.10.041","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"1918_CR26","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10288-019-00412-2","volume":"18","author":"S Bojari","year":"2020","unstructured":"Bojari, S., Eslahchi, M.R.: Global convergence of a family of modified BFGS methods under a modified weak-Wolfe-Powell line search for nonconvex functions. 4OR-Q. J. Oper. Res. 18(2), 219\u2013244 (2020). https:\/\/doi.org\/10.1007\/s10288-019-00412-2","journal-title":"4OR-Q. J. Oper. Res."},{"issue":"4","key":"1918_CR27","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1007\/s11590-016-1060-2","volume":"11","author":"C Andrea","year":"2017","unstructured":"Andrea, C., Giovanni, F., Massimo, R.: Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods. Optim. Lett. 11(4), 835\u2013853 (2017). https:\/\/doi.org\/10.1007\/s11590-016-1060-2","journal-title":"Optim. Lett."},{"issue":"3","key":"1918_CR28","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1007\/s11075-019-00709-7","volume":"83","author":"S Bojari","year":"2020","unstructured":"Bojari, S., Eslahchi, M.R.: Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization. Numer. Algorithms 83(3), 901\u2013933 (2020). https:\/\/doi.org\/10.1007\/s11075-019-00709-7","journal-title":"Numer. Algorithms"},{"key":"1918_CR29","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2020.1843167","author":"MR Eslahchi","year":"2020","unstructured":"Eslahchi, M.R., Bojari, S.: Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization. Optim. Method Softw. (2020). https:\/\/doi.org\/10.1080\/10556788.2020.1843167","journal-title":"Optim. Method Softw."},{"key":"1918_CR30","doi-asserted-by":"publisher","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, Springer Series in Operations Research, New York (2006). https:\/\/doi.org\/10.1007\/978-0-387-40065-5","DOI":"10.1007\/978-0-387-40065-5"},{"key":"1918_CR31","unstructured":"Andrei, N.: An unconstrained optimization test functions collection. Adv. Model. Optim. 10(1), 147\u2013161 (2008). https:\/\/api.semanticscholar.org\/CorpusID:63504217"},{"issue":"2","key":"1918_CR32","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1504\/IJMMNO.2013.055204","volume":"4","author":"M Jamil","year":"2013","unstructured":"Jamil, M., Yang, X.S.: A literature survey of benchmark functions for global optimisation problems. Int. J. Math. Model. Numer. Optim. 4(2), 150\u2013194 (2013). https:\/\/doi.org\/10.1504\/IJMMNO.2013.055204","journal-title":"Int. J. Math. Model. Numer. Optim."},{"issue":"2","key":"1918_CR33","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math. Program."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01918-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-023-01918-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01918-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T13:22:27Z","timestamp":1703164947000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-023-01918-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,5]]},"references-count":33,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1918"],"URL":"https:\/\/doi.org\/10.1007\/s12190-023-01918-z","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,5]]},"assertion":[{"value":"5 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2023","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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}