A NEW NONLINEAR CONJUGATE GRADIENT METHOD WITH EXACT LINE SEARCH FOR UNCONSTRAINED OPTIMIZATION
Keywords:
Exact line search, Conjugate gradient coefficient, Global convergenceAbstract
This paper deals with a new nonlinear conjugate gradient method for solving large-scale unconstrained optimization problems. We prove that the new conjugate gradient coefficients with exact line search is globally convergent. Preliminary numerical results show that is very efficient when compared to the other classical conjugate gradient coefficients FR,PRP, NPRP, and RMILThis paper deals with a new nonlinear conjugate gradient method for solving large-scale unconstrained optimization problems. We prove that the new conjugate gradient coefficients with exact line search is globally convergent. Preliminary numerical results show that is very efficient when compared to the other classical conjugate gradient coefficients FR,PRP, NPRP, and RMIL
References
M R Hestenes and E Stiefel, Methods of conjugate gradients for solving linear systems. Journal of Research of the National Bureau of Standards, 1952. 49(6): p. 409.
R Fletcher and C M Reeves, Function minimization by conjugate gradients. The computer journal, 1964. 7(2): p. 149.
E Polak and G Ribiere, Note Sur la convergence de directions conjuge`es. ESAIM: Mathematical Modelling and Numerical Analysis, 1969. 3E(16): p. 35.
B T Polyak, The conjugate gradient method in extreme problems. USSR Computational Mathematics and Mathematical Physics, 1969. 9(4): p. 807.
R Fletcher, Practical Method of Optimization. 2 ed. Unconstrained Optimization, ed. Wiley. Vol. I. 1997, New York.
Y Liu and C Storey, Efficient generalized conjugate gradient algorithms, Part 1: Theory. Journal of Optimization Theory and Applications, 1991. 69(1): p. 129.
Y H Dai and Y Yuan, A nonlinear conjugate gradient method with a strong global convergence property. SIAM Journal on Optimization, 1999. 10(1): p. 177.
M Al-Baali, Descent Property and Global Convergence of the Fletcher-Reeves Method with Inexact Line Search. IMA Journal of Numerical Analysis, 1985. 5: p. 121.
Y H Dai and Y Yuan, Further studies on the Polak-Ribiere-Polyak method, 1995, Research report ICM-95-040, Institute of Computational Mathematics and Scientific/Engineering Computing, Chinese Academy of Sciences.
Y H Dai and Y Yuan, Convergence properties of the Fletcher-Reeves method. IMA Journal of Numerical Analysis, 1996. 16(2): p. 155.
L Min, F Heying, and L Jianguo, The global convergence of a descent PRP conjugate gradient method. Computational and Applied Mathematics, 2012. 31(1): p. 59.
Z-J Shi and J Shen, Convergence of the Polak–Ribiére–Polyak conjugate gradient method. Nonlinear Analysis: Theory, Methods & Applications, 2007. 66(6): p. 1428.
D Touati-Ahmed and C Storey, Efficient Hybrid Conjugate Gradient Techniques. Journal of Optimization Theory and Applications, 1990. 64(2): p. 379.
Y Q Zhang, H Zheng, and C L Zhang. Global Convergence of a Modified PRP Conjugate Gradient Method. In International Conference on Advances in Computational Modeling and Simulation. 2012.
G Zoutendijk, Nonlinear programming, computational methods, in Integer and nonlinear programming. 1970: North-Holland, Amsterdam. p. 37.
M J Powell, Nonconvex minimization calculations and the conjugate gradient method, in Numerical analysis. 1984, Springer. p. 122.
J C Gilbert and J Nocedal, Global convergence properties of conjugate gradient methods for optimization. SIAM Journal on Optimization, 1992. 2: p. 21.
N Andrei, Another hybrid conjugate gradient algorithm for unconstrained optimization. Numerical Algorithms, 2008. 47(2): p. 143.
N Andrei, Another Conjugate Gradient Algorithm with Guaranteed Descent and Conjugacy Conditions for Large-scale Unconstrained Optimization. Journal of Optimization Theory and Applications, 2013. 159(1): p. 159.
Z Dai and F Wen, Another improved Wei–Yao–Liu nonlinear conjugate gradient method with sufficient descent property. Applied Mathematics and Computation, 2012. 218(14): p. 7421.
Liu, G H, Jing, L L, Han, L X, and Han, D, A Class of Nonmonotone Conjugate Gradient Methods for Unconstrained Optimization. Journal of Optimization Theory and Applications, 1999. 101(1): p. 127.
Y Narushima and H Yabe, Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization. Journal of Computational and Applied Mathematics, 2012. 236(17): p. 4303.
A P Qu, D H Li, and M Li, The convergence rate of a restart MFR conjugate gradient method with inexact line search. Applied Mathematics and Computation, 2012. 218(23): p. 11380.
Z J Shi, S Wang, and Z Xu, The convergence of conjugate gradient method with nonmonotone line search. Applied Mathematics and Computation, 2010. 217(5): p. 1921.
Z X Wei, S W Yao, and L Y Liu, The convergence properties of some new conjugate gradient methods. Applied Mathematics and Computation, 2006. 183(2): p. 1341.
S Yao, X Lu, and Z Wei, A Conjugate Gradient Method with Global Convergence for Large-Scale Unconstrained Optimization Problems. Journal of Applied Mathematics, 2013. 2013: p. 1.
G Yuan, A Conjugate Gradient Method for Unconstrained Optimization Problems. International Journal of Mathematics and Mathematical Sciences, 2009. 2009: p. 1.
G Yuan, X Lu, and Z Wei, A conjugate gradient method with descent direction for unconstrained optimization. Journal of Computational and Applied Mathematics, 2009. 233(2): p. 519.
L Zhang, An improved Wei–Yao–Liu nonlinear conjugate gradient method for optimization computation. Applied Mathematics and Computation, 2009. 215(6): p. 2269.
Rivaie, M., Mamat, M., Leong, W. J., andMohd, I., A new class of nonlinear conjugate gradient coefficients with global convergence properties. Applied Mathematics and Computation, 2012. 218(22): p. 11323.
Hamoda, M, Rivaie, M, Mamat, M, and Salleh, Z, A conjugate gradient method with strong Wolfe-Powell line search for unconstrained optimization. Applied Mathematical Sciences, 2016. 10(15): p. 721-734.
N Andrei, An unconstrained optimization test functions collection. Advanced Modeling and Optimization, 2008. 10(1): p. 147.
S Mishra, Some new test functions for global optimization and performance of repulsive particle swarm method. 2006.
M Molga and C Smutnicki. Test functions for optimization needs. 2005; Available from http://www.zsd.ict.pwr.wroc.pl/files/docs/functions.pdf.
K E Hillstrom, A simulation test approach to the evaluation of nonlinear optimization algorithms. ACM Transactions on Mathematical Software, 1977. 3(4): p. 305.
E D Dolan and J JMor, Benchmarking optimization software with performance profiles. Mathematical Programming, 2002. 91(2): p. 201.
Downloads
Published
Issue
Section
License
Copyright (c) 2017 Journal of Basic Sciences
This work is licensed under a Creative Commons Attribution 4.0 International License.
