{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T11:48:42Z","timestamp":1780573722975,"version":"3.54.1"},"reference-count":28,"publisher":"EDP Sciences","issue":"6","license":[{"start":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T00:00:00Z","timestamp":1669680000000},"content-version":"vor","delay-in-days":28,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2022,11,11]]},"published-print":{"date-parts":[[2022,11]]},"abstract":"<jats:p>In this paper, we proposed a new hybrid conjugate gradient algorithm for solving unconstrained optimization problems as a convex combination of the Dai-Yuan algorithm, conjugate-descent algorithm, and Hestenes-Stiefel algorithm. This new algorithm is globally convergent and satisfies the sufficient descent condition by using the strong Wolfe conditions. The numerical results show that the proposed nonlinear hybrid conjugate gradient algorithm is efficient and robust.<\/jats:p>","DOI":"10.1051\/ro\/2022200","type":"journal-article","created":{"date-parts":[[2022,11,14]],"date-time":"2022-11-14T20:02:55Z","timestamp":1668456175000},"page":"4047-4056","source":"Crossref","is-referenced-by-count":5,"title":["An efficient new hybrid CG-method as convex combination of DY and CD and HS algorithms"],"prefix":"10.1051","volume":"56","author":[{"given":"Amina","family":"Hallal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammed","family":"Belloufi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Badreddine","family":"Sellami","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"250","published-online":{"date-parts":[[2022,11,29]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1016\/j.matcom.2021.05.038","volume":"201","author":"Abubakara","year":"2022","journal-title":"Math. Comput. Simul."},{"key":"R2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s11075-007-9152-9","volume":"47","author":"Andrei","year":"2008","journal-title":"Numer. Algorithms"},{"key":"R3","first-page":"147","volume":"10","author":"Andrei","year":"2008","journal-title":"Adv. Model. Optim."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Andrei N., New hybrid conjugate gradient algorithms for unconstrained optimization. Encycl. Optim. (2009) 2560\u20132571.","DOI":"10.1007\/978-0-387-74759-0_441"},{"key":"R5","doi-asserted-by":"crossref","first-page":"6506","DOI":"10.3934\/math.2021383","volume":"6","author":"Abubakar","year":"2021","journal-title":"AIMS Math."},{"key":"R6","doi-asserted-by":"crossref","first-page":"101923","DOI":"10.1016\/j.jksus.2022.101923","volume":"3","author":"Abubakar","year":"2022","journal-title":"J. King Saud Univ. Sci."},{"key":"R7","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"Dai","year":"1999","journal-title":"SIAM J. Optim."},{"key":"R8","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s002450010019","volume":"43","author":"Dai","year":"2001","journal-title":"Appl. Math. Optim."},{"key":"R9","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1137\/S1052623497318992","volume":"10","author":"Dai","year":"1999","journal-title":"SIAM J. Optim."},{"key":"R10","doi-asserted-by":"crossref","first-page":"113823","DOI":"10.1016\/j.cam.2021.113823","volume":"405","author":"Deepho","year":"2022","journal-title":"J. Comput. Appl. Math."},{"key":"R11","doi-asserted-by":"crossref","first-page":"3083","DOI":"10.2298\/FIL1611083D","volume":"30","author":"Djordjevic","year":"2016","journal-title":"Filomat"},{"key":"R12","doi-asserted-by":"crossref","first-page":"1813","DOI":"10.2298\/FIL1706813D","volume":"31","author":"Djordjevic","year":"2017","journal-title":"Filomat"},{"key":"R13","first-page":"366","volume":"2","author":"Djordjevic","year":"2018","journal-title":"J. Appl. Math. Comput."},{"key":"R14","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"Dolan","year":"2002","journal-title":"Math. Program."},{"key":"R15","unstructured":"Fletcher R., Practical methods of optimization, 2nd edition. A Wiley-Interscience Publication. John Wiley and Sons, Inc NY, USA (1987)."},{"key":"R16","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"Fletcher","year":"1964","journal-title":"Comput. J."},{"key":"R17","first-page":"35","volume":"2","author":"Hager","year":"2006","journal-title":"Pacific J. Optim."},{"key":"R18","doi-asserted-by":"crossref","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"Hestenes","year":"1952","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"R19","doi-asserted-by":"crossref","unstructured":"Ibrahim A.H., Kumam P., Kamandi A. and Abubakar A.B., An efficient hybrid conjugate gradient method for unconstrained optimization. Optim. Methods Softw. (2022).","DOI":"10.1080\/10556788.2021.1998490"},{"key":"R20","first-page":"150","volume":"4","author":"Jamil","year":"2013","journal-title":"Int. J. Math. Model. Numer. Optim."},{"key":"R21","first-page":"129","volume":"69","author":"Liu","year":"1991","journal-title":"Part 1: Theory J. Optim. Theory Appl."},{"key":"R22","first-page":"36","volume":"245","author":"Liu","year":"2014","journal-title":"Appl. Math. Comput."},{"key":"R23","unstructured":"Malik M., Abubakar A.B., Sulaiman I.M., Mamat M., Abas S.S. and Sukono S., A new three-term conjugate gradient method for unconstrained optimization with applications in portfolio selection and robotic motion control. Part 1: Theory J. Optim. Theory Appl. 51 (2021)."},{"key":"R24","first-page":"35","volume":"16","author":"Polak","year":"1969","journal-title":"Revue Francaise d\u2019Informatique et de Recherche Op\u00e9rationnelle"},{"key":"R25","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","volume":"9","author":"Polyak","year":"1969","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"R26","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01593790","volume":"2","author":"Powell","year":"1977","journal-title":"Math. Program."},{"key":"R27","doi-asserted-by":"crossref","unstructured":"Sellami B., Belloufi M. and Chaib Y., Globally convergece of nonlinear conjugate gradient method for unconstrainted optimization. RAIRO:RO (2017).","DOI":"10.1051\/ro\/2017028"},{"key":"R28","first-page":"185","volume":"13","author":"Wolfe","year":"1971","journal-title":"II : Some correct. SIAM Rev."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2022200\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T09:08:17Z","timestamp":1669712897000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2022200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11]]},"references-count":28,"journal-issue":{"issue":"6"},"alternative-id":["ro220287"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2022200","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"2804-7303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11]]}}}