Abstract
In this paper, an improved spectral conjugate gradient algorithm is developed for solving nonconvex unconstrained optimization problems. Different from the existent methods, the spectral and conjugate parameters are chosen such that the obtained search direction is always sufficiently descent as well as being close to the quasi-Newton direction. With these suitable choices, the additional assumption in the method proposed by Andrei on the boundedness of the spectral parameter is removed. Under some mild conditions, global convergence is established. Numerical experiments are employed to demonstrate the efficiency of the algorithm for solving large-scale benchmark test problems, particularly in comparison with the existent state-of-the-art algorithms available in the literature.

Similar content being viewed by others
References
Andrei, N.: Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization. Bull. Malays. Math. Soc. 34(2), 319–330 (2011)
Gilbert, J.C., Nocedal, J.: Global convergence properties of conjugate gradient methods for optimization. SIAM J. Optim. 2(1), 21–42 (1992)
Wei, Z.X., Li, G., Qi, L.: Global convergence of the Polak–Ribiére–Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems. Math. Comput. 77, 2173–2193 (2008)
Wu, C.Y.: A modified PRP conjugate gradient algorithm for unconstrained optimization problems. Math. Appl. 1, 25–29 (2011)
Yu, G.H., Guan, L.T., Wei, Z.X.: Globally convergent Polak–Ribiére–Polyak conjugate gradient methods under a modified Wolfe line search. Appl. Math. Comput. 215(8), 3082–3090 (2009)
Yuan, G.: Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems. Optim. Lett. 3, 11–21 (2009)
Yuan Lu X, G., Wei, Z.X.: A conjugate gradient method with descent direction for unconstrained optimization. J. Comput. Appl. Math. 233(2), 519–530 (2009)
Zhang, L., Zhou, W.J., Li, D.H.: Global convergence of a modified Fletcher–Reeves conjugate gradient method with Armijo-type line search. Numer. Math. 104, 561–572 (2006)
Wang, C., Chen, Y., Du, S.: Further insight into the Shamanskii modification of Newton method. Appl. Math. Comput. 180, 46–52 (2006)
Zhang, L., Zhou, W.J., Li, D.H.: A descent modified Polak–Ribiére–Polyak conjugate gradient method and its global convergence. IMA J. Numer. Anal. 26, 629–640 (2006)
Hager, W.W., Zhang, H.: A survey of nonlinear conjugate gradient methods. Pac. J. Optim. 2, 35–58 (2006)
Andrei, N.: New accelerated conjugate gradient algorithms as a modification of Dai–Yuan’s computational scheme for unconstrained optimization. J. Comput. Appl. Math. 234, 3397–3410 (2010)
Du, S.Q., Chen, Y.Y.: Global convergence of a modified spectral FR conjugate gradient method. Appl. Math. Comput. 202, 766–770 (2008)
Jiang, H.B., Deng, S.H., Zheng, X.D., Wan, Z.: Global convergence of a modified spectral conjugate gradient method. J. Appl. Math. (2012). doi:10.1155/2012/641276
Wan, Z., Hu, C.M., Yang, Z.L.: A spectral PRP conjugate gradient methods for nonconvex optimization problem based on modified line search. Discrete Contin. Dyn. Syst., Ser. B 16(4), 1157–1169 (2011)
Wan, Z., Yang, Z.L., Wang, Y.L.: New spectral PRP conjugate gradient method for unconstrained optimization. Appl. Math. Lett. 24(1), 16–22 (2011)
Zhang, L., Zhou, W.J.: Spectral gradient projection method for solving nonlinear monotone equations. J. Comput. Appl. Math. 196(2), 478–484 (2006)
Hager, W.W., Zhang, H.: A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J. Optim. 16, 170–192 (2005)
Dai, Y.H., Liao, L.Z.: New conjugacy conditions and related nonlinear conjugate gradient methods. Appl. Math. Optim. 43, 87–101 (2001)
Zoutendijk, G.: Nonlinear programming, computational methods. In: Abadie, J. (ed.) Integer and Nonlinear Programming, pp. 37–86. North-Holland, Amsterdam (1970)
Andrei, N.: An unconstrained optimization test functions collection. Adv. Model. Optim. 10(1), 147–161 (2008)
Bongartz, I., Conn, A.R., Gould, N., Toint Ph, L.: CUTE: constrained and unconstrained testing environments. ACM Trans. Math. Softw. 21, 123–160 (1995)
Hager, W.W., Zhang, H.: Algorithm 851: CG_DESCENT, a conjugate gradient method with guaranteed descent. ACM Trans. Math. Softw. 32, 113–137 (2006)
Andrei, N.: Scaled conjugate gradient algorithms for unconstrained optimization. Comput. Optim. Appl. 38, 401–416 (2007)
Acknowledgements
This work is supported by National Natural Science Foundation of China (Grant No. 71071162, 70921001, 71210003).
The authors would like to express their thanks to the three anonymous referees for their constructive comments on the paper, which have greatly improved its presentation.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Kok Lay Teo.
Rights and permissions
About this article
Cite this article
Deng, S., Wan, Z. & Chen, X. An Improved Spectral Conjugate Gradient Algorithm for Nonconvex Unconstrained Optimization Problems. J Optim Theory Appl 157, 820–842 (2013). https://doi.org/10.1007/s10957-012-0239-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-012-0239-7