A modified quadratic hybridization of Polak-Ribiere-Polyak and Fletcher-Reeves conjugate gradient method for unconstrained optimization problems

Pro Kaelo; Sindhu Narayanan; M.V. Thuto

doi:10.11121/ijocta.01.2017.00339

Authors

Pro Kaelo University of Botswana
Sindhu Narayanan
M.V. Thuto

DOI:

https://doi.org/10.11121/ijocta.01.2017.00339

Keywords:

Hybridization, conjugate gradient, Wolfe line search conditions, Global convergence

Abstract

This article presents a modified quadratic hybridization of the Polak–Ribiere–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. We also report some numerical results to show the competitiveness of the new hybrid method.

Downloads

Download data is not yet available.

Author Biography

Pro Kaelo, University of Botswana

Senior Lecturer, Mathematics Department

References

M. AlBaali,Y. Narushima and H. Yabe, A family of three term conjugate gradient methods with sufficient descent property for unconstrained optimization, Computational Optimization and Applications, 60, 89–110, 2015.

N. Andrei, A new three term conjugate gradient algorithm for unconstrained optimization, Numerical Algorithms, 68, 305–321, 2015.

N. Andrei, An unconstrained optimization test functions collection, Advanced Modelling and Optimization, 10(1):147–161, 2008.

S. Babaie-Kafaki, A quadratic hybridization of Polak-Ribiere-Polyak and Fletcher-Reeves conjugate gradient methods, Journal of Optimization Theory and Applications, 154(3), 916-932, 2012.

S. Babaie-Kafaki, A Note on the global convergence of the quadratic hybridization of Polak-Ribiere-Polyak and Fletcher-Reeves conjugate gradient methods, Journal of Optimization Theory and Applications, 157(1), 297-298, 2013.

S. Babaie-Kafaki, Two modified scaled nonlinear conjugate gradient methods, Journal of Computational and Applied Mathematics, 261, 172–182, 2014.

S. Babaie-Kafaki, M. Fatemi, and N. MahdaviAmiri, Two effective hybrid conjugate gradient algorithms based on modified BFGS updates, Numerical Algorithms, 58:315–331, 2011.

S. BabaieKafaki and R. Ghanbari, A descent extension of the Polak-Ribiere-Polyak conjugate gradient method, Computers and Mathematics with Applications, 68, 2005–2011, 2014.

Y.H. Dai, Conjugate gradient methods with Armijo type in searches, Acta Mathematicae Applicatae Sinica, English Series, 18(1):123–130, 2002.

Y.H. Dai and L.Z. Liao, New conjugacy conditions and related nonlinear conjugate gradient methods, Applied Mathematics and Optimization, 43, 87–101, 2001.

Y.H. Dai and Y. Yuan, A class of globally convergent conjugate gradient methods, Science China Series A, 46(2), 251–261, 2003.

Y.H. Dai and Y. Yuan, A nonlinear conjugate gradient method with strong global convergence property, SIAM Journal on Optimization, 10(1), 177-182, 1999.

Y.H. Dai and Y. Yuan, An efficient hybrid conjugate gradient method for unconstrained optimization, Annals of Operations Research, 103, 33–47, 2001.

Z. Dai and F. Wen, Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property, Applied Mathematics and Computation, 218:7421–7430, 2012.

Z.F. Dai and B.S. Tian, Global convergence of some modified PRP nonlinear conjugate gradient methods, Optimization Letters, 5, 615–630, 2011.

E.D. Dolan and J.J. More, Benchmarking optimization software with profile performance profiles, Mathematical Programming, 91(2), 201–213, 2002.

X.L. Dong, H. Liu and Y. He, A self adjusting conjugate gradient method with sufficient descent condition and conjugacy condition, Journal of Optimization Theory and Applications, 165, 225–241, 2015.

X.L. Dong, H.W. Liu, Y.B. He and X.M. Yang, A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition, Journal of Computational and Applied Mathematics, 281, 239–249, 2015.

Y. Dong, A practical PR+ conjugate gradient method only using gradient, Applied Mathematics and Computation, 219(4), 2041-2052, 2012.

R. Fletcher and C. Reeves, Function minimization by conjugate gradients, Computer Journal, 7, 149–154, 1964.

J.C. Gilbert and J. Nocedal, Global convergence properties of conjugate gradient methods for optimization, SIAM Journal on Optimization, 2(1), 21–42, 1992.

W.W. Hager and H. Zhang, A survey of nonlinear conjugate gradient methods, Pacific Journal of Optimization, 2(1), 35–58, 2006.

M.R. Hestenes and E. Stiefel, Methods for conjugate gradients for solving linear systems, Journal of Research of the National Bureau of Standards 49, 409-436, 1952.

W. Jia, J. Zong and X. Wang, An improved mixed conjugate gradient method, Systems Engineering Procedia 2:219–225, 2012.

H. Liu, A mixture conjugate gradient method for unconstrained optimization, Third International Symposium on Intelligent Information Technology and Security Informatics, IEEE, 26–29, 2010.

Y. Liu and C. Storey, Efficient generalized conjugate gradient algorithms, Part 1: theory, Journal of Optimization Theory and Applications, 69, 129-137, 1992.

J. Liu, A hybrid nonlinear conjugate gradient method, Lobachevskii Journal of Mathematics, 33(3):195–199, 2012.

J.K. Liu and S.J. Li, New hybrid conjugate gradient method for unconstrained optimization, Applied Mathematics and Computation, 245, 36–43, 2014

J. Mo, N. Gu and Z. Wei, Hybrid conjugate gradient methods for unconstrained optimization, Optimization Methods and Software, 22(2), 297–307, 2007.

J.J. More, B.S. Garbow and K.E. Hillstrom, Testing unconstrained optimization software, ACM Transactions on Mathematical Software, 7:17–41, 1981.

J. Nocedal and S.J. Wright, Numerical Optimization, 2nd Edition, Springer Science+ Business Media, LLC. Printed in the United States of Ameraica, 2006.

E. Polak, and G. Ribiere, Note sur la convergence de methodes de directions conjuguees, Revue Fran¸caise d’Infomatique et de Recherche Operationnelle, 3(16): 35–43, 1969.

B.T. Polyak, The conjugate gradient method in Extreme problems, USSR Computational Mathematics and Mathematical Physics, 9(4):94–112, 1969.

Z.J. Shi, Convergence of line search methods for unconstrained optimization, Applied Mathematics and Computation, 157:393–405, 2004.

M. Sun and J. Liu, Three modified Polak-Ribiere-Polyak conjugate gradient methods with sufficient descent property, Journal of Inequalities and Applications, 2015–2125, 2015.

D. Touati-Ahmed and C. Storey, Efficient hybrid conjugate gradient techniques, Journal of Optimization Theory and Applications, 64(2):379–397, 1990.

H. Yabe and N. Sakaiwa, A new nonlinear conjugate gradient method for unconstrained optimization, Journal of Operations Research, 48(4):284–296, 2005.

H. Yan, L. Chen, and B. Jiao, HSLSCD hybrid conjugate gradient algorithm for unconstrained optimization, Second International Workshop on Computer Science and Engineering, IEEE, 264–268, 2009.

G. Yuan and X. Lu, A modified PRP conjugate gradient method, Annals of Operations Research, 166, 73–90, 2009.

L. Zhang, W. Zhou and D.H. Li, A descent modified Polak-Ribi ere-Polyak conjugate gradient method and its global convergence, IMA Journal on Numerical Analysis, 26:629–640, 2006.

A. Zhou, Z. Zhu, H. Fan and Q. Qing, Three new hybrid conjugate gradient methods for optimization, Applied Mathematics, 2(3):303–308, 2011.