{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T07:28:33Z","timestamp":1780385313163,"version":"3.54.1"},"reference-count":32,"publisher":"EDP Sciences","issue":"1","license":[{"start":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T00:00:00Z","timestamp":1708560000000},"content-version":"vor","delay-in-days":52,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"There are no Funding"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2023,12,20]]},"published-print":{"date-parts":[[2024,1]]},"abstract":"<jats:p>We know many conjugate gradient algorithms (CG) for solving unconstrained optimization problems. In this paper, based on the three famous Liu\u2013Storey (LS), Fletcher\u2013Reeves (FR) and Polak\u2013Ribi\u00e9re\u2013Polyak (PRP) conjugate gradient methods, a new hybrid CG method is proposed. Furthermore, the search direction satisfies the sufficient descent condition independent of the line search. Likewise, we prove, under the strong Wolfe line search, the global convergence of the new method. In this respect, numerical experiments are performed and reported, which show that the proposed method is efficient and promising. In virtue of this, the application of the proposed method for solving regression models of COVID-19 is provided.<\/jats:p>","DOI":"10.1051\/ro\/2023196","type":"journal-article","created":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T20:05:58Z","timestamp":1703189158000},"page":"613-627","source":"Crossref","is-referenced-by-count":5,"title":["A new family of hybrid conjugate gradient method for unconstrained optimization and its application to regression analysis"],"prefix":"10.1051","volume":"58","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3610-3346","authenticated-orcid":false,"given":"Sabrina","family":"Ben Hanachi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-6981-5207","authenticated-orcid":false,"given":"Badreddine","family":"Sellami","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammed","family":"Belloufi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"250","published-online":{"date-parts":[[2024,2,22]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1016\/j.matcom.2021.05.038","volume":"201","author":"Abubakar","year":"2022","journal-title":"Math. Comput. Simul."},{"key":"R2","first-page":"55","volume":"17","author":"Andrei","year":"2008","journal-title":"Stud. Inf. Control"},{"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":"89","DOI":"10.1080\/10556780802393326","volume":"24","author":"Andrei","year":"2009","journal-title":"Optim. Methods Softw."},{"key":"R6","doi-asserted-by":"crossref","unstructured":"Andrei N., Nonlinear Conjugate Gradient Methods for Unconstrained Optimization. Springer (2020).","DOI":"10.1007\/978-3-030-42950-8"},{"key":"R7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/200979.201043","volume":"21","author":"Bongartz","year":"1995","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"R8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"Dai","year":"1999","journal-title":"SIAM J. Optim."},{"key":"R9","doi-asserted-by":"crossref","first-page":"3083","DOI":"10.2298\/FIL1611083D","volume":"30","author":"Djordjevi\u0107","year":"2016","journal-title":"Filomat"},{"key":"R10","first-page":"366","volume":"2","author":"Djordjevi\u0107","year":"2018","journal-title":"J. Appl. Math. Comput."},{"key":"R11","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/s10473-019-0117-6","volume":"39","author":"Djordjevi\u0107","year":"2019","journal-title":"Acta Math. Sci."},{"key":"R12","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"Dolan","year":"2002","journal-title":"Math. Program."},{"key":"R13","unstructured":"Fletcher R., Practical Methods of Optimization, Unconstrained Optimization. Vol. 1. John Wiley and Son, New York (1980)."},{"key":"R14","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":"R15","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1137\/0802003","volume":"2","author":"Gilbert","year":"1992","journal-title":"SIAM J. Optim."},{"key":"R16","first-page":"35","volume":"2","author":"Hager","year":"2006","journal-title":"Pac. J. Optim."},{"key":"R17","doi-asserted-by":"crossref","first-page":"2315","DOI":"10.1051\/ro\/2022109","volume":"56","author":"Hanachi","year":"2022","journal-title":"RAIRO: Oper. Res."},{"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. Nat. Bur. Stand."},{"key":"R19","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/BF00939927","volume":"71","author":"Hu","year":"1991","journal-title":"J. Optim. Theory Appl."},{"key":"R20","first-page":"84","volume":"63","author":"Li","year":"2010","journal-title":"Int. J. Pure Appl. Math."},{"key":"R21","first-page":"36","volume":"245","author":"Liu","year":"2014","journal-title":"Appl. Math. Comput."},{"key":"R22","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF00940464","volume":"69","author":"Liu","year":"1991","journal-title":"J. Optim. Theory App."},{"key":"R23","first-page":"35","volume":"3","author":"Polak","year":"1969","journal-title":"Revue Fran\u00e7aise D\u2019informatique et De Recherche Op\u00e9rationnelle, S\u00e9rie Rouge."},{"key":"R24","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":"R25","first-page":"1100","volume":"23","author":"Sulaiman","year":"2021","journal-title":"Indones. J. Electr. Eng. Comput. Sci."},{"key":"R26","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF00939455","volume":"64","author":"Touati-Ahmed","year":"1990","journal-title":"J. Optim. Theory Appl."},{"key":"R27","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1137\/1011036","volume":"11","author":"Wolfe","year":"1969","journal-title":"SIAM Rev."},{"key":"R28","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1137\/1013035","volume":"13","author":"Wolfe","year":"1971","journal-title":"SIAM Rev."},{"key":"R29","unstructured":"World heath organization, Report on coronavirus (COVID-19) (2020)."},{"key":"R30","unstructured":"World Health Organization (WHO), Naming the coronavirus disease (COVID-19) and the virus that causes it. Braz. J. Implantol. Health Sci. 2 (2020)."},{"key":"R31","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1016\/S0140-6736(20)30260-9","volume":"395","author":"Wu","year":"2020","journal-title":"The Lancet"},{"key":"R32","unstructured":"Zoutendijk G., Nonlinear programming, computational methods. Integer Nonlinear Program. (1970) 37\u201386."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2023196\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T09:11:34Z","timestamp":1708593094000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2023196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1]]},"references-count":32,"journal-issue":{"issue":"1"},"alternative-id":["ro230109"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2023196","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"2804-7303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1]]}}}