The new method is tested on a number of benchmark problems that have been extensively used in the literature and numerical results show the competitiveness of the new hybrid method.
📌 3 Key Takeaways
🎯
Objective & Hypothesis:This article presents a modified quadratic hybridization of the Polak–Ribi`ere– Polyak and Fletcher–Reeves conjugate gradient method for solving unconstrained optimization problems.
📊
Key Findings & Data:Global convergence, with the strong Wolfe line search conditions, of the proposed quadratic hybrid conjugate gradient method is established.
💡
Conclusion & Impact:The new method is tested on a number of benchmark problems that have been extensively used in the literature and numerical results show the competitiveness of the new hybrid method.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters
Abstract
This article presents a modified quadratic hybridization of the Polak–Ribi`ere– Polyak and Fletcher–Reeves conjugate gradient method for solving unconstrained optimization problems. Global convergence, with the strong Wolfe line search conditions, of the proposed quadratic hybrid conjugate gradient method is established. The new method is tested on a number of benchmark problems that have been extensively used in the literature and numerical results show the competitiveness of the new hybrid method.
🔖
Cite This Article
NARAYANAN, S., KAELO, P., THUTO, M. (2022). A modified quadratic hybridization of Polak-Ribi`re-Polyak and Fletcher-Reeves conjugate gradient method for unconstrained optimization problems. An International Journal of Optimization and Control: Theories & Applications (IJOCTA), Cilt: 7 - Sayı: 2, 177–185. https://ajindex.com/articles/440679
Al-Baali, M., Narushima, Y. and Yabe, H., A family of three term conjugate gradient methods with suffi- cient descent property for unconstrained optimization, Comput. Optim. Appl., 60, 89–110 (2015)
Andrei, N., A new three-term conjugate gradient algorithm for unconstrained optimization, Numer. Algorithms, 68, 305–321 (2015)
Andrei, N., An unconstrained optimization test functions collection, Adv. Model. Optim., 10(1), 147–161 (2008)
Babaie-Kafaki, S., A quadratic hybridization of PolakRibiere-Polyak and Fletcher-Reeves conjugate gradient methods, J Optim. Theory Appl., 154(3), 916-932 (2012)
Babaie-Kafaki, S., A Note on the global convergence of the quadratic hybridization of Polak-Ribiere-Polyak and Fletcher-Reeves conjugate gradient methods, J Optim. Theory Appl., 157(1), 297-298 (2013)
Babaie-Kafaki, S., Fatemi, M., and Mahdavi-Amiri, N., Two effective hybrid conjugate gradient algorithms based on modified BFGS updates, Numer. Algorithms, 58, 315–331 (2011)
Babaie-Kafaki, S. and Ghanbari, R., A descent extension of the Polak-Ribi`ere-Polyak conjugate gradient method, Comp. Math. Appl., 68, 2005–2011 (2014)
Dai, Y.-H., Conjugate gradient methods with Armijotype line searches, Acta Math. Appl. Sin. Engl. Ser., 18(1), 123–130 (2002)
Dai, Y.-H. and Liao, L.Z., New conjugacy conditions and related nonlinear conjugate gradient methods, Appl. Math. Optim., 43, 87–101 (2001)
Dai, Y.-H. and Yuan, Y., A class of globally convergent conjugate gradient methods, Sci. China Ser. A., 46(2), 251–261 (2003)
Dai, Y.-H. and Yuan, Y., A nonlinear conjugate gradient method with strong global convergence property, SIAM J. Optim., 10(1), 177-182 (1999)
Dai, Y.-H., and Yuan, Y., An efficient hybrid conjugate gradient method for unconstrained optimization, Ann. Oper. Res., 103, 33–47 (2001)
Dai, Z. and Wen, F., Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property, Appl. Math. Comput., 218:7421– 7430 (2012)
Dai, Z.-F. and Tian, B.-S., Global convergence of some modified PRP nonlinear conjugate gradient methods, Optim. Lett., 5, 615–630 (2011)
Dolan, E.D. and Mor´e, J.J., Benchmarking optimization software with profile performance profiles, Math. Program., 91(2), 201–213 (2002)