Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 103517, 7 pages
http://dx.doi.org/10.1155/2015/103517
Research Article

An Efficient Hybrid Conjugate Gradient Method with the Strong Wolfe-Powell Line Search

1School of Informatics and Applied Mathematics, Universiti Malaysia Terengganu, 21030 Kuala Terengganu, Terengganu, Malaysia
2Faculty of Informatics and Computing, Universiti Sultan Zainal Abidin, 21300 Kuala Terengganu, Terengganu, Malaysia
3Department of Computer Science and Mathematics, Universiti Teknologi MARA (UITM) Terengganu, Campus Kuala Terengganu, 21080 Kuala Terengganu, Terengganu, Malaysia

Received 11 March 2015; Revised 6 July 2015; Accepted 7 July 2015

Academic Editor: Haipeng Peng

Copyright © 2015 Ahmad Alhawarat 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. P. Wolfe, “Convergence conditions for ascent methods,” SIAM Review, vol. 11, no. 2, pp. 226–235, 1969. View at Google Scholar
  2. P. Wolfe, “Convergence conditions for ascent methods. II: some corrections,” SIAM Review, vol. 13, no. 2, pp. 185–188, 1971. View at Publisher · View at Google Scholar
  3. J. Cai, Q. Li, L. Li, H. Peng, and Y. Yang, “A fuzzy adaptive chaotic ant swarm optimization for economic dispatch,” International Journal of Electrical Power and Energy Systems, vol. 34, no. 1, pp. 154–160, 2012. View at Publisher · View at Google Scholar · View at Scopus
  4. K. Natallia, An Introduction to Heuristic Slgorithms, Department of Informatics and Telecommunications, 2005.
  5. L. Li, H. Peng, J. Kurths, Y. Yang, and H. J. Schellnhuber, “Chaos-order transition in foraging behavior of ants,” Proceedings of the National Academy of Sciences of the United States of America, vol. 111, no. 23, pp. 8392–8397, 2014. View at Publisher · View at Google Scholar · View at Scopus
  6. M. Wan, L. Li, J. Xiao, C. Wang, and Y. Yang, “Data clustering using bacterial foraging optimization,” Journal of Intelligent Information Systems, vol. 38, no. 2, pp. 321–341, 2012. View at Publisher · View at Google Scholar · View at Scopus
  7. M. Wan, C. Wang, L. Li, and Y. Yang, “Chaotic ant swarm approach for data clustering,” Applied Soft Computing Journal, vol. 12, no. 8, pp. 2387–2393, 2012. View at Publisher · View at Google Scholar · View at Scopus
  8. 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, no. 6, pp. 409–436, 1952. View at Google Scholar
  9. R. Fletcher and C. M. Reeves, “Function minimization by conjugate gradients,” The Computer Journal, vol. 7, no. 2, pp. 149–154, 1964. View at Publisher · View at Google Scholar · View at MathSciNet
  10. P. Elijah and G. Ribiere, “Note sur la convergence de méthodes de directions conjuguées,” Revue française d'informatique et de recherche opérationnelle, vol. 3, no. 1, pp. 35–43, 1969. View at Google Scholar
  11. 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 MathSciNet · View at Scopus
  12. G. Zoutendijk, “Nonlinear programming, computational methods,” Integer and Nonlinear Programming, vol. 143, no. 1, pp. 37–86, 1970. View at Google Scholar
  13. 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 MathSciNet · View at Scopus
  14. L. Guanghui, H. Jiye, and Y. Hongxia, “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 Scopus
  15. 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
  16. 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
  17. 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 Scopus
  18. Y. Shengwei, Z. Wei, and H. Huang, “A note about WYL's conjugate gradient method and its applications,” Applied Mathematics and Computation, vol. 191, no. 2, pp. 381–388, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. L. Zhang, “An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation,” Applied Mathematics and Computation, vol. 215, no. 6, pp. 2269–2274, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. Z. Dai and F. Wen, “Another improved Wei–Yao–Liu nonlinear conjugate gradient method with sufficient descent property,” Applied Mathematics and Computation, vol. 218, no. 14, pp. 7421–7430, 2012. View at Publisher · View at Google Scholar · View at Scopus
  21. M. Rivaie, M. Mamat, L. W. June, and I. Mohd, “A new class of nonlinear conjugate gradient coefficients with global convergence properties,” Applied Mathematics and Computation, vol. 218, no. 22, pp. 11323–11332, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. A. Alhawarat, M. Mamat, M. Rivaie, and I. Mohd, “A new modification of nonlinear conjugate gradient coefficients with global convergence properties,” International Journal of Mathematical, Computational, Statistical, Natural and Physical Engineering, vol. 8, no. 1, pp. 54–60, 2014. View at Google Scholar
  23. A. Neculai, “An unconstrained optimization test functions collection,” Advanced Modeling and Optimization, vol. 10, no. 1, pp. 147–161, 2008. View at Google Scholar
  24. I. Bongartz, A. R. Conn, N. Gould, P. L. Toint, and I. Bongartz, Constrained and Unconstrained Testing Environment, Département de Mathématique, 1993.
  25. E. P. Adorio and U. Diliman, “Mvf-multivariate test functions library in c for unconstrained global optimization,” 2005.
  26. 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 Scopus