Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014 (2014), Article ID 394096, 9 pages
http://dx.doi.org/10.1155/2014/394096
Research Article

Two Modified Three-Term Type Conjugate Gradient Methods and Their Global Convergence for Unconstrained Optimization

1College of Communication Engineering, Jilin University, Changchun 130025, China
2Department of Mathematics, College of Humanities and Sciences of Northeast Normal University, Changchun 130117, China
3Key Laboratory of Bionic Engineering of Ministry of Education, Jilin University, Changchun 130025, China

Received 22 July 2014; Revised 5 November 2014; Accepted 6 November 2014; Published 23 November 2014

Academic Editor: Masoud Hajarian

Copyright © 2014 Zhongbo Sun et al. 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. D.-H. Li and M. Fukushima, “A modified BFGS method and its global convergence in nonconvex minimization,” Journal of Computational and Applied Mathematics, vol. 129, no. 1-2, pp. 15–35, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. 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
  3. 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 Publisher · View at Google Scholar · View at MathSciNet
  4. M. R. Polak and G. Ribiere, “Note surla convergence des methodes de directions conjuguees,” Revue Française d’Automatique, Informatique, Recherche Opérationnelle, vol. 16, pp. 35–43, 1969. View at Google Scholar
  5. B. T. Polyak, “The conjugate gradient method in extremal problems,” USSR Computational Mathematics and Mathematical Physics, vol. 9, no. 4, pp. 94–112, 1969. View at Publisher · View at Google Scholar · View at Scopus
  6. R. Fletcher, Unconstained Optimization: Practical Methods of Optimization, vol. 1, John Wiley & Sons, New York, NY, USA, 1987.
  7. Y. Liu and C. Storey, “Efficient generalized conjugate gradient algorithms, Part 1,” Journal of Optimization Theory and Applications, vol. 69, no. 1, pp. 129–137, 1991. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. Y. H. Dai and Y. Yuan, “An efficient hybrid conjugate gradient method for unconstrained optimization,” Annals of Operations Research, vol. 103, pp. 33–47, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  9. E. M. L. Beale, “A derivative of conjugate gradients,” in Numerical Methods for Nolinear Optimization, F. A. Lootsma, Ed., pp. 39–43, Academic Press, London, UK, 1972. View at Google Scholar
  10. M. F. McGuire and P. Wolfe, “Evaluating a restart procedure for conjugate gradients,” Tech. Rep. RC-4382, IBM Research Center, Yorktown Heights, NY, USA, 1973. View at Google Scholar
  11. M. J. D. Powell, “Nonconvex minimization calculations and the conjugate gradient method,” in Numerical Analysis, vol. 1066 of Lecture Notes in Mathematics, pp. 122–141, Springer, Berlin, Germany, 1984. View at Publisher · View at Google Scholar · View at MathSciNet
  12. 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 MathSciNet · View at Scopus
  13. Y.-H. Dai and L.-Z. Liao, “New conjugacy conditions and related nonlinear conjugate gradient methods,” Applied Mathematics and Optimization, vol. 43, no. 1, pp. 87–101, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. N. Andrei, “A simple three-term conjugate gradient algorithm for unconstrained optimization,” Journal of Computational and Applied Mathematics, vol. 241, pp. 19–29, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. N. Andrei, “On three-term conjugate gradient algorithms for unconstrained optimization,” Applied Mathematics and Computation, vol. 219, no. 11, pp. 6316–6327, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  16. S. Yao and B. Qin, “A hybrid of DL and WYL nonlinear conjugate gradient methods,” Abstract and Applied Analysis, vol. 2014, Article ID 279891, 9 pages, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. S. Yao, X. Lu, and B. Qin, “A modified conjugacy condition and related nonlinear conjugate gradient method,” Mathematical Problems in Engineering, vol. 2014, Article ID 710376, 9 pages, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. 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 · View at Scopus
  19. Y. H. Dai, “On the nonmonotone line search,” Journal of Optimization Theory and Applications, vol. 112, no. 2, pp. 315–330, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  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 MathSciNet · View at Scopus
  21. L. Zhang, W. Zhou, and D. Li, “Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search,” Numerische Mathematik, vol. 104, no. 4, pp. 561–572, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  22. Z. Sun, T. Zhu, S. Weng, and H. Gao, “A new family sufficient descent conjugate gradient methods for unconstrained optimization,” in Proceedings of the 23rd Chinese Control Conference (CCC ’12), pp. 2532–2536, July 2012. View at Scopus
  23. Z. B. Sun, T. Zhu, and H. Gao, “A sufficient descent hybrid conjugate gradient method and its global convergence for unconstrained optimization,” in Proceedings of the 24th Chinese Control and Decision Conference (CCDC ’12), pp. 735–739, May 2012. View at Publisher · View at Google Scholar · View at Scopus
  24. 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 MathSciNet
  25. 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 Publisher · View at Google Scholar · View at MathSciNet · View at Scopus