Open Access
Issue
RAIRO-Oper. Res.
Volume 60, Number 2, March-April 2026
Page(s) 1269 - 1286
DOI https://doi.org/10.1051/ro/2026031
Published online 06 May 2026
  • N. Andrei, A hybrid conjugate gradient algorithm for unconstrained optimization as a convex combination of Hestenes-Stiefel and Dai-Yuan. Stud. Inform. Control. 17 (2008) 57. [Google Scholar]
  • N. Andrei, A double parameter scaled BFGS method for unconstrained optimization. J. Comput. Appl. Math. 332 (2018) 26–44. [Google Scholar]
  • N. Andrei, Nonlinear Conjugate Gradient Methods for Unconstrained Optimization. Springer, Cham (2020). [Google Scholar]
  • S. Babaie-Kafaki and R. Ghanbari, A descent family of Dai-Liao conjugate gradient methods. Optim. Method. Softw. 29 (2014) 583–591. [Google Scholar]
  • W. Cheng, A two-term PRP-based descent method. Numer. Funct. Anal. Optim. 28 (2007) 1217–1230. [Google Scholar]
  • Z. Dai, Comments on a new class of nonlinear conjugate gradient coefficients with global convergence properties. Appl. Math. Comput. 276 (2016) 297–300. [CrossRef] [MathSciNet] [Google Scholar]
  • Y.-H. Dai and L.-Z. Liao, New conjugacy conditions and related nonlinear conjugate gradient methods. Appl. Math. Optim. 43 (2001) 87–101. [Google Scholar]
  • Z. Dai and T. Wu, The impact of oil shocks on systemic risk of the commodity markets. J. Syst. Sci. Complex. 37 (2024) 1–24. [Google Scholar]
  • Y.-H. Dai and Y. Yuan, A nonlinear conjugate gradient method with a strong global convergence property. SIAM J. Optim. 10 (2019) 177–182. [Google Scholar]
  • Z. Dai and X. Zhang, Climate policy uncertainty and risks taken by the bank: evidence from China. Int. Rev. Financ. Anal. 87 (2023) 102579. [Google Scholar]
  • E.D. Dolan and J.J. Moré, Benchmarking optimization software with performance profiles. Math. Program. 91 (2002) 201–213. [Google Scholar]
  • X. Dong, H. Liu, Y. He, S. Babaie-Kafaki and R. Ghanbari, A new three–term conjugate gradient method with descent direction for unconstrained optimization. Math. Model. Anal. 21 (2016) 399–411. [Google Scholar]
  • S.S. Đorđević, New hybrid conjugate gradient method as a convex combination of LS and CD methods. Filomat 31 (2017) 1813–1825. [CrossRef] [MathSciNet] [Google Scholar]
  • S.S. Đorđević, New hybrid conjugate gradient method as a convex combination of LS and FR methods. Acta Math. Sci. 39 (2019) 214–228. [CrossRef] [MathSciNet] [Google Scholar]
  • R. Fletcher, Practical Methods of Optimization. A Wiley Interscience Publication, New Jersey (1987). [Google Scholar]
  • R. Fletcher and C.M. Reeves, Function minimization by conjugate gradients. Comput. J. 7 (1964) 149–154. [Google Scholar]
  • J.C. Gilbert and J. Nocedal, Global convergence properties of conjugate gradient methods for optimization. SIAM J. Optim. 2 (1992) 21–42. [Google Scholar]
  • W.W. Hager and H. Zhang, A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J. Optim. 16 (2005) 170–192. [Google Scholar]
  • W.W. Hager and H. Zhang, A survey of nonlinear conjugate gradient methods. Pac. J. Optim. 2 (2006) 35–58. [MathSciNet] [Google Scholar]
  • N. Hamel, N. Benrabia, M. Ghiat and H. Guebbai, A new hybrid conjugate gradient algorithm based on the Newton direction to solve unconstrained optimization problems. J. Appl. Math. Comput. 69 (2023) 2531–2548. [Google Scholar]
  • M.R. Hestenes and E. Stiefel, Methods of conjugate gradients for solving. J. Res. Natl. Bur. Stand. 49 (1952) 409. [CrossRef] [Google Scholar]
  • J. Liu and S. Li, New hybrid conjugate gradient method for unconstrained optimization. Appl. Math. Comput. 245 (2014) 36–43. [MathSciNet] [Google Scholar]
  • Y. Liu and C. Storey, Efficient generalized conjugate gradient algorithms, part 1: theory. J. Optim. Theory Appl. 69 (1991) 129–137. [Google Scholar]
  • J. Liu, Y. Feng and L. Zou, Some three-term conjugate gradient methods with the inexact line search condition. Calcolo 55 (2018) 1–16. [CrossRef] [MathSciNet] [Google Scholar]
  • J. Liu, Y. Zhao and X. Wu, Some three-term conjugate gradient methods with the new direction structure. Appl. Numer. Math. 150 (2020) 433–443. [CrossRef] [MathSciNet] [Google Scholar]
  • J. Momin and Y. Xin-She, A literature survey of benchmark functions for global optimization problems. Int. J. Math. Model. Numer. Optim. 4 (2013) 150–194. [Google Scholar]
  • Y. Narushima, H. Yabe and J.A. Ford, A three-term conjugate gradient method with sufficient descent property for unconstrained optimization. SIAM J. Optim. 21 (2011) 212–230. [MathSciNet] [Google Scholar]
  • S. Nasiru, R.O. Mathew, Y.W. Mohammed, S.H. Abubakar and S. Suraj, A Dai–Liao hybrid conjugate gradient method for unconstrained optimization. IJIO 2 (2021) 69–84. [Google Scholar]
  • J. Nocedal, Theory of algorithms for unconstrained optimization. Acta Numer. 1 (1992) 199–242. [Google Scholar]
  • A. Perry, A modified conjugate gradient algorithm. Oper. Res. 26 (1978) 1073–1078. [Google Scholar]
  • E. Polak and G. Ribiere, Note sur la convergence de methodes de directions conjuguees. USSR Comput. Math. Math. Phys. 9 (1969) 94–112. [CrossRef] [Google Scholar]
  • B.T. Polyak, A general method for solving extremal problems. Dokl. Akad. Nauk SSSR 174 (1967) 33–36. [Google Scholar]
  • M.J. Powell, Nonconvex minimization calculations and the conjugate gradient method, in Numerical Analysis. Springer, Berlin (1984) 122–141. [Google Scholar]
  • A. Renfrew, Introduction to robotics: mechanics and control. Int. J. Electr. Eng. Educ. 41 (2004) 388. [Google Scholar]
  • M. Rivaie, M. Mamat, L.W. June and I. Mohd, A new class of nonlinear conjugate gradient coefficients with global convergence properties. Appl. Math. Comput. 218 (2012) 11323–11332. [CrossRef] [MathSciNet] [Google Scholar]
  • N. Salihu, M. Odekunle, M. Waziri and A. Halilu, A new hybrid conjugate gradient method based on secant equation for solving large scale unconstrained optimization problems. Iran. J. Optim. 12 (2020) 33–44. [Google Scholar]
  • N. Salihu, M.R. Odekunle, A.M. Saleh and S. Salihu, A Dai–Liao hybrid hestenes-stiefel and fletcher-revees methods for unconstrained optimization. IJIO 2 (2021) 33–50. [Google Scholar]
  • N. Salihu, H.A. Babando, I. Arzuka and S. Salihu, A hybrid conjugate gradient method for unconstrained optimization with application. Bangmod J-MCS 9 (2023) 24–44. [Google Scholar]
  • N. Salihu, P. Kumam, I.M. Sulaiman and T. Seangwattana, An efficient spectral minimization of the Dai–Yuan method with application to image reconstruction. AIMS Math. 8 (2023) 30940–30962. [Google Scholar]
  • N. Salihu, P. Kumam, S.M. Ibrahim and H.A. Babando, A sufficient descent hybrid conjugate gradient method without line search consideration and application. Eng. Comput. 41 (2024). [Google Scholar]
  • N. Salihu, P. Kumam, S.M. Ibrahim and W. Kumam, Some combined techniques of spectral conjugate gradient methods with applications to robotic and image restoration models. Numer. Algor. 100 (2024) 1–41. [Google Scholar]
  • N. Salihu, P. Kumam, I.M. Sulaiman, I. Arzuka and W. Kumam, An efficient Newton-like conjugate gradient method with restart strategy and its application. Math. Comput. Simul. 226 (2024) 354–372. [Google Scholar]
  • N. Salihu, P. Kumam, I.M. Sulaiman and S. Salihu, A descent matrix-free nonlinear conjugate gradient algorithm for impulse noise removal. NCAO 3 (2024) 25–46. [Google Scholar]
  • I.M. Sulaiman, M. Malik, A.M. Awwal, P. Kumam, M. Mamat and S. Al-Ahmad, On three-term conjugate gradient method for optimization problems with applications on covid-19 model and robotic motion control. Adv. Contin. Discret. Model. 2022 (2022) 1–22. [Google Scholar]
  • X. Wu, A new spectral Polak–Ribière–Polak conjugate gradient method. ScienceAsia 41 (2015) 345–349. [Google Scholar]
  • L. Zhang, W. Zhou and D.-H. Li, A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence. IMA J. Numer. Anal. 26 (2006) 629–640. [CrossRef] [MathSciNet] [Google Scholar]
  • L. Zhang, W. Zhou and D. Li, Some descent three-term conjugate gradient methods and their global convergence. Optim. Method. Softw. 22 (2007) 697–711. [Google Scholar]
  • Y. Zhang, L. He, C. Hu, J. Guo, J. Li and Y. Shi, General four-step discrete-time zeroing and derivative dynamics applied to time-varying nonlinear optimization. J. Comput. Appl. Math. 347 (2019) 314–329. [Google Scholar]
  • G. Zoutendijk, Nonlinear programming, computational methods, in Integer and Nonlinear Programming edited by J. Abadie. North-Holland, Amsterdam (1970) 37–86. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.