{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T07:01:13Z","timestamp":1772262073235,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T00:00:00Z","timestamp":1677456000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T00:00:00Z","timestamp":1677456000000},"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,6]]},"DOI":"10.1007\/s12190-022-01821-z","type":"journal-article","created":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T17:03:20Z","timestamp":1677517400000},"page":"2531-2548","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A new hybrid conjugate gradient algorithm based on the Newton direction to solve unconstrained optimization problems"],"prefix":"10.1007","volume":"69","author":[{"given":"Naima","family":"Hamel","sequence":"first","affiliation":[]},{"given":"Noureddine","family":"Benrabia","sequence":"additional","affiliation":[]},{"given":"Mourad","family":"Ghiat","sequence":"additional","affiliation":[]},{"given":"Hamza","family":"Guebbai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,27]]},"reference":[{"issue":"4","key":"1821_CR1","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":"2","key":"1821_CR2","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1137\/1011036","volume":"11","author":"P Wolfe","year":"1969","unstructured":"Wolfe, P.: Convergence conditions for ascent methods. SIAM Rev. 11(2), 226\u2013235 (1969). https:\/\/doi.org\/10.1137\/1011036","journal-title":"SIAM Rev."},{"issue":"2","key":"1821_CR3","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1137\/1013035","volume":"13","author":"P Wolfe","year":"1971","unstructured":"Wolfe, P.: Convergence conditions for ascent methods. II: some corrections. SIAM Rev. 13(2), 185\u2013188 (1971). https:\/\/doi.org\/10.1137\/1013035","journal-title":"SIAM Rev."},{"key":"1821_CR4","doi-asserted-by":"publisher","first-page":"527","DOI":"10.4208\/nmtma.OA-2020-0056","volume":"14","author":"S Narayanan","year":"2021","unstructured":"Narayanan, S., Kaelo, P.: A linear hybridization of Dai\u2013Yuan and Hestenes\u2013Stiefel conjugate gradient method for unconstrained optimization. Numer. Math. Theor. Meth. Appl. 14, 527\u2013539 (2021). https:\/\/doi.org\/10.4208\/nmtma.OA-2020-0056","journal-title":"Numer. Math. Theor. Meth. Appl."},{"issue":"6","key":"1821_CR5","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.L.: Methods of conjugate gradients for solving linear systems. J. Res. Natl. Bur. Stand. 49(6), 409\u2013436 (1952). https:\/\/doi.org\/10.6028\/jres.049.044","journal-title":"J. Res. Natl. Bur. Stand."},{"issue":"2","key":"1821_CR6","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, C.M.: Function minimization by conjugate gradients. Comput. J. 7(2), 149\u2013154 (1964). https:\/\/doi.org\/10.1093\/comjnl\/7.2.149","journal-title":"Comput. J."},{"issue":"16","key":"1821_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1051\/m2an\/196903R100351","volume":"3","author":"E Polak","year":"1969","unstructured":"Polak, E., Ribi\u00e9re, G.: Note sur la convergence de m\u00e9thodes de directions conjugu\u00e9es. Rev. Fr. Inf. Rech. Oper. 3(16), 35\u201343 (1969). https:\/\/doi.org\/10.1051\/m2an\/196903R100351","journal-title":"Rev. Fr. Inf. Rech. Oper."},{"issue":"4","key":"1821_CR8","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 extremal 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."},{"key":"1821_CR9","unstructured":"Fletcher, R.: Practical methods of optimization. Unconstrained Optimization. vol. 1, John Wiley and Sons, New York (1987)"},{"issue":"1","key":"1821_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF00940464","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(1), 129\u2013137 (1991). https:\/\/doi.org\/10.1007\/BF00940464","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1821_CR11","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":"1","key":"1821_CR12","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s002450010019","volume":"43","author":"YH Dai","year":"2001","unstructured":"Dai, Y.H., Liao, L.Z.: New conjugacy conditions and related nonlinear conjugate gradient methods. Appl. Math. Optim. 43(1), 87\u2013101 (2001). https:\/\/doi.org\/10.1007\/s002450010019","journal-title":"Appl. Math. Optim."},{"key":"1821_CR13","doi-asserted-by":"crossref","unstructured":"Yao, S., Qin, B.: A hybrid of DL and WYL nonlinear conjugate gradient methods. Abstract and Applied Analysis, vol. 2014, Article ID 279891, p. 9 (2014). https:\/\/doi.org\/10.1155\/2014\/279891","DOI":"10.1155\/2014\/279891"},{"issue":"1","key":"1821_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40064-016-2522-9","volume":"5","author":"X Xu","year":"2016","unstructured":"Xu, X., Kong, F.Y.: New hybrid conjugate gradient methods with the generalized Wolfe line search. SpringerPlus. 5(1), 1\u201310 (2016). https:\/\/doi.org\/10.1186\/s40064-016-2522-9","journal-title":"SpringerPlus."},{"issue":"11","key":"1821_CR15","doi-asserted-by":"publisher","first-page":"3083","DOI":"10.2298\/FIL1611083D","volume":"30","author":"SS Djordjevi\u0107","year":"2016","unstructured":"Djordjevi\u0107, S.S.: New hybrid conjugate gradient method as a convex combination of FR and PRP methods. Filomat. 30(11), 3083\u20133100 (2016). https:\/\/doi.org\/10.2298\/FIL1611083D","journal-title":"Filomat."},{"issue":"6","key":"1821_CR16","doi-asserted-by":"publisher","first-page":"1813","DOI":"10.2298\/FIL1706813D","volume":"31","author":"SS Djordjevi\u0107","year":"2017","unstructured":"Djordjevi\u0107, S.S.: New hybrid conjugate gradient method as a convex combination of LS and CD methods. Filomat. 31(6), 1813\u20131825 (2017). https:\/\/doi.org\/10.2298\/FIL1706813D","journal-title":"Filomat."},{"issue":"2","key":"1821_CR17","doi-asserted-by":"publisher","first-page":"177","DOI":"10.11121\/ijocta.01.2017.00339","volume":"7","author":"P Kaelo","year":"2017","unstructured":"Kaelo, P., Narayanan, S., Thuto, M.V.: A modified quadratic hybridization of Polak-Ribiere-Polyak and Fletcher-Reeves conjugate gradient method for unconstrained optimization problems. Int. J. Opt. Control Theor.-Appl. (IJOCTA) 7(2), 177\u2013185 (2017). https:\/\/doi.org\/10.11121\/ijocta.01.2017.00339","journal-title":"Int. J. Opt. Control Theor.-Appl. (IJOCTA)"},{"issue":"2","key":"1821_CR18","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.11591\/ijeecs.v20.i2.pp1007-1015","volume":"20","author":"BA Hassan","year":"2020","unstructured":"Hassan, B.A., Owaid, O.A., Yasen, Z.T.: A variant of hybrid conjugate gradient methods based on the convex combination for optimization. Indones. J Electr. Eng. Comput. Sci. 20(2), 1007\u20131015 (2020). https:\/\/doi.org\/10.11591\/ijeecs.v20.i2.pp1007-1015","journal-title":"Indones. J Electr. Eng. Comput. Sci."},{"key":"1821_CR19","doi-asserted-by":"crossref","unstructured":"Alhawarat, A., Salleh, D., Masmali, I.A.: A convex combination between two different search directions of conjugate gradient method and application in image restoration. Mathematical Problems in Engineering (2021). https:\/\/doi.org\/10.1155\/2021\/9941757","DOI":"10.1155\/2021\/9941757"},{"issue":"2","key":"1821_CR20","doi-asserted-by":"publisher","first-page":"150","DOI":"10.26555\/ijain.v5i2.356","volume":"5","author":"NS Mohamed","year":"2019","unstructured":"Mohamed, N.S., Mamat, M., Rivaie, M., Shaharudin, S.M.: A comparison on classical-hybrid conjugate gradient method under exact line search. Int. J. Adv. Intell. Inform. 5(2), 150\u2013168 (2019). https:\/\/doi.org\/10.26555\/ijain.v5i2.356","journal-title":"Int. J. Adv. Intell. Inform."},{"issue":"1","key":"1821_CR21","doi-asserted-by":"publisher","first-page":"163","DOI":"10.34198\/ejms.6121.163174","volume":"6","author":"OB Akinduko","year":"2021","unstructured":"Akinduko, O.B.: A new conjugate gradient method with sufficient descent property. Earthline J. Math. Sci. 6(1), 163\u2013174 (2021). https:\/\/doi.org\/10.34198\/ejms.6121.163174","journal-title":"Earthline J. Math. Sci."},{"issue":"2","key":"1821_CR22","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s11075-007-9152-9","volume":"47","author":"N Andrei","year":"2008","unstructured":"Andrei, N.: Another hybrid conjugate gradient algorithm for unconstrained optimization. Numer. Algorithms 47(2), 143\u2013156 (2008). https:\/\/doi.org\/10.1007\/s11075-007-9152-9","journal-title":"Numer. Algorithms"},{"key":"1821_CR23","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.amc.2014.07.096","volume":"245","author":"JK Liu","year":"2014","unstructured":"Liu, J.K., Li, S.J.: New hybrid conjugate gradient method for unconstrained optimization. Appl. Math. Comput. 245, 36\u201343 (2014). https:\/\/doi.org\/10.1016\/j.amc.2014.07.096","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"1821_CR24","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1080\/09720502.2020.1815346","volume":"24","author":"FN Jardow","year":"2021","unstructured":"Jardow, F.N., Al-Naemi, G.M.: A new hybrid conjugate gradient algorithm as a convex combination of MMWU and RMIL nonlinear problems. J. Interdiscip. Math. 24(3), 637\u2013655 (2021). https:\/\/doi.org\/10.1080\/09720502.2020.1815346","journal-title":"J. Interdiscip. Math."},{"issue":"1","key":"1821_CR25","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/s10473-019-0117-6","volume":"39","author":"SS Djordjevi\u0107","year":"2019","unstructured":"Djordjevi\u0107, S.S.: New hybrid conjugate gradient method as a convex combination of LS and FR methods. Acta. Math. Sci. 39(1), 214\u2013228 (2019). https:\/\/doi.org\/10.1007\/s10473-019-0117-6","journal-title":"Acta. Math. Sci."},{"issue":"9","key":"1821_CR26","doi-asserted-by":"publisher","first-page":"366","DOI":"10.26855\/jamc.2018.09.002","volume":"2","author":"SS Djordjevi\u0107","year":"2018","unstructured":"Djordjevi\u0107, S.S.: New hybrid conjugate gradient method as a convex combination of HS and FR conjugate gradient methods. J. Appl. Math. Comput. 2(9), 366\u2013378 (2018). https:\/\/doi.org\/10.26855\/jamc.2018.09.002","journal-title":"J. Appl. Math. Comput."},{"issue":"6","key":"1821_CR27","doi-asserted-by":"publisher","first-page":"6506","DOI":"10.3934\/math.2021383","volume":"6","author":"AB Abubakar","year":"2021","unstructured":"Abubakar, A.B., Kumam, P., Malik, M., Chaipunya, P., Ibrahim, A.H.: A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection. AIMS Math. 6(6), 6506\u20136527 (2021). https:\/\/doi.org\/10.3934\/math.2021383","journal-title":"AIMS Math."},{"issue":"1","key":"1821_CR28","doi-asserted-by":"publisher","first-page":"245","DOI":"10.3934\/jimo.2018149","volume":"16","author":"M Li","year":"2020","unstructured":"Li, M.: A three term Polak-Ribi\u00e8re-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method. J. Indus. Manag. Optim. 16(1), 245\u2013260 (2020). https:\/\/doi.org\/10.3934\/jimo.2018149","journal-title":"J. Indus. Manag. Optim."},{"key":"1821_CR29","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1007\/s11075-018-0479-1","volume":"79","author":"IE Livieris","year":"2018","unstructured":"Livieris, I.E., Tampakas, V., Pintelas, P.: A descent hybrid conjugate gradient method based on the memoryless BFGS update. Numer. Algorithms 79, 1169\u20131185 (2018). https:\/\/doi.org\/10.1007\/s11075-018-0479-1","journal-title":"Numer. Algorithms"},{"issue":"4","key":"1821_CR30","first-page":"373","volume":"17","author":"N Andrei","year":"2008","unstructured":"Andrei, N.: A hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization as a convex combination of Hestenes-Stiefel and Dai-Yuan algorithms. Stud. Inform. Control. 17(4), 373\u2013392 (2008)","journal-title":"Stud. Inform. Control."},{"key":"1821_CR31","unstructured":"Zoutendijk, G.: Nonlinear programming, computational methods. Integer and nonlinear programming. 37\u201386 (1970)"},{"issue":"1","key":"1821_CR32","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1023\/A:1012930416777","volume":"103","author":"Y Dai","year":"2001","unstructured":"Dai, Y., Yuan, Y.: An efficient hybrid conjugate gradient method for unconstrained optimization. Ann. Oper. Res. 103(1), 33\u201347 (2001). https:\/\/doi.org\/10.1023\/A:1012930416777","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"1821_CR33","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":"1821_CR34","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.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-022-01821-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-022-01821-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-022-01821-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T15:25:00Z","timestamp":1685114700000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-022-01821-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,27]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1821"],"URL":"https:\/\/doi.org\/10.1007\/s12190-022-01821-z","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,27]]},"assertion":[{"value":"15 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 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"}}]}}