Table of Contents Author Guidelines Submit a Manuscript
International Journal of Mathematics and Mathematical Sciences
Volume 2009, Article ID 329623, 14 pages
http://dx.doi.org/10.1155/2009/329623
Research Article

A Conjugate Gradient Method for Unconstrained Optimization Problems

College of Mathematics and Information Science, Guangxi University, Nanning, Guangxi 530004, China

Received 5 July 2009; Revised 28 August 2009; Accepted 1 September 2009

Academic Editor: Petru Jebelean

Copyright © 2009 Gonglin Yuan. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. G. H. Yu, Nonlinear self-scaling conjugate gradient methods for large-scale optimization problems, Doctorial thesis, Sun Yat-Sen University, Guangzhou, China, 2007.
  2. G. Yuan and Z. Wei, “New line search methods for unconstrained optimization,” Journal of the Korean Statistical Society, vol. 38, no. 1, pp. 29–39, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  3. R. Fletcher and C. M. Reeves, “Function minimization by conjugate gradients,” The Computer Journal, vol. 7, pp. 149–154, 1964. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. E. Polak and G. Ribière, “Note sur la convergence de méthodes de directions conjuguées,” Revue Francaised Informatiquet de Recherche Operiionelle, vol. 3, no. 16, pp. 35–43, 1969. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. M. R. Hestenes and E. Stiefel, “Methods of conjugate gradients for solving linear systems,” Journal of Research of the National Bureau of Standards, vol. 49, pp. 409–436, 1952. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. R. Fletcher, Practical Methods of Optimization. Vol. 1: Unconstrained Optimization, John Wiley & Sons, New York, NY, USA, 2nd edition, 1997.
  7. Y. Liu and C. Storey, “Efficient generalized conjugate gradient algorithms. I. Theory,” Journal of Optimization Theory and Applications, vol. 69, no. 1, pp. 129–137, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. Y. H. Dai and Y. Yuan, “A nonlinear conjugate gradient method with a strong global convergence property,” SIAM Journal on Optimization, vol. 10, no. 1, pp. 177–182, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. J. Nocedal, “Conjugate gradient methods and nonlinear optimization,” in Linear and Nonlinear Conjugate Gradient-Related Methods (Seattle, WA, 1995), L. Adams and J. L. Nazareth, Eds., pp. 9–23, SIAM, Philadelphia, Pa, USA, 1996. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. E. Polak, Optimization: Algorithms and Consistent Approximations, vol. 124 of Applied Mathematical Sciences, Springer, New York, NY, USA, 1997. View at MathSciNet
  11. Y. Yuan and W. Sun, Theory and Methods of Optimization, Science Press of China, Beijing, China, 1999.
  12. Y. Dai, “A nonmonotone conjugate gradient algorithm for unconstrained optimization,” Journal of Systems Science and Complexity, vol. 15, no. 2, pp. 139–145, 2002. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. W. W. Hager and H. Zhang, “A new conjugate gradient method with guaranteed descent and an efficient line search,” SIAM Journal on Optimization, vol. 16, no. 1, pp. 170–192, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. W. W. Hager and H. Zhang, “Algorithm 851: CGDESCENT, a conjugate gradient method with guaranteed descent,” ACM Transactions on Mathematical Software, vol. 32, no. 1, pp. 113–137, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  15. W. W. Hager and H. Zhang, “A survey of nonlinear conjugate gradient methods,” Pacific Journal of Optimization, vol. 2, pp. 35–58, 2006. View at Google Scholar
  16. Z. Wei, G. Li, and L. Qi, “New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems,” Applied Mathematics and Computation, vol. 179, no. 2, pp. 407–430, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. Z. Wei, S. Yao, and L. Liu, “The convergence properties of some new conjugate gradient methods,” Applied Mathematics and Computation, vol. 183, no. 2, pp. 1341–1350, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. G. Yuan, “Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems,” Optimization Letters, vol. 3, no. 1, pp. 11–21, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. G. Yuan and X. Lu, “A modified PRP conjugate gradient method,” Annals of Operations Research, vol. 166, pp. 73–90, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. L. Zhang, W. Zhou, and D.-H. Li, “A descent modified Polak-Ribière-Polyak conjugate gradient method and its global convergence,” IMA Journal of Numerical Analysis, vol. 26, no. 4, pp. 629–640, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  21. M. J. D. Powell, “Restart procedures for the conjugate gradient method,” Mathematical Programming, vol. 12, no. 2, pp. 241–254, 1977. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  22. G. Zoutendijk, “Nonlinear programming, computational methods,” in Integer and Nonlinear Programming, J. Abadie, Ed., pp. 37–86, North-Holland, Amsterdam, The Netherlands, 1970. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  23. M. Al-Baali, “Descent property and global convergence of the Fletcher-Reeves method with inexact line search,” IMA Journal of Numerical Analysis, vol. 5, no. 1, pp. 121–124, 1985. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  24. G. H. Liu, J. Y. Han, and H. X. Yin, “Global convergence of the Fletcher-Reeves algorithm with inexact linesearch,” Applied Mathematics: A Journal of Chinese Universities, vol. 10, no. 1, pp. 75–82, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  25. H. Huang, Z. Wei, and S. Yao, “The proof of the sufficient descent condition of the Wei-Yao-Liu conjugate gradient method under the strong Wolfe-Powell line search,” Applied Mathematics and Computation, vol. 189, no. 2, pp. 1241–1245, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  26. D. Touati-Ahmed and C. Storey, “Efficient hybrid conjugate gradient techniques,” Journal of Optimization Theory and Applications, vol. 64, no. 2, pp. 379–397, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  27. J. C. Gilbert and J. Nocedal, “Global convergence properties of conjugate gradient methods for optimization,” SIAM Journal on Optimization, vol. 2, no. 1, pp. 21–42, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  28. Y. F. Hu and C. Storey, “Global convergence result for conjugate gradient methods,” Journal of Optimization Theory and Applications, vol. 71, no. 2, pp. 399–405, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  29. N. Andrei, “Another hybrid conjugate gradient algorithm for unconstrained optimization,” Numerical Algorithms, vol. 47, no. 2, pp. 143–156, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  30. N. Andrei, “Hybrid conjugate gradient algorithm for unconstrained optimization,” Journal of Optimization Theory and Applications, vol. 141, no. 2, pp. 249–264, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  31. Y. H. Dai and Y. Yuan, Nonlinear Conjugate Gradient Methods, Shanghai Scientific and Technical, Shanghai, China, 1998.
  32. Z. F. Li, J. Chen, and N. Y. Deng, “Convergence properties of conjugate gradient methods with Goldstein line search,” Journal of China Agricultural University, vol. 1, no. 4, pp. 15–18, 1996. View at Google Scholar
  33. M. J. D. Powell, “Nonconvex minimization calculations and the conjugate gradient method,” in Numerical Analysis (Dundee, 1983), vol. 1066 of Lecture Notes in Mathematics, pp. 122–141, Springer, Berlin, Germany, 1984. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  34. J. J. Moré, B. S. Garbow, and K. E. Hillstrom, “Testing unconstrained optimization software,” ACM Transactions on Mathematical Software, vol. 7, no. 1, pp. 17–41, 1981. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  35. E. D. Dolan and J. J. Moré, “Benchmarking optimization software with performance profiles,” Mathematical Programming, vol. 91, no. 2, pp. 201–213, 2002. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  36. K. E. Bongartz, A. R. Conn, N. I. M. Gould, and P. L. Toint, “CUTE: constrained and unconstrained testing environments,” ACM Transactions on Mathematical Software, vol. 21, pp. 123–160, 1995. View at Google Scholar