Table of Contents Author Guidelines Submit a Manuscript
Abstract and Applied Analysis
Volume 2014, Article ID 279891, 9 pages
http://dx.doi.org/10.1155/2014/279891
Research Article

A Hybrid of DL and WYL Nonlinear Conjugate Gradient Methods

1School of Information and Statistics, Guangxi University of Finance and Economics, Nanning 530003, China
2School of Science, East China University of Science and Technology, Shanghai 200237, China

Received 29 November 2013; Accepted 27 January 2014; Published 25 March 2014

Academic Editor: Abdon Atangana

Copyright © 2014 Shengwei Yao and Bin Qin. 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. 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
  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. E. Polak and G. Ribière, “Note sur la convergence de méthodes de directions conjuguées,” Revue Française d'Informatique et de Recherche Opérationnelle, vol. 3, no. 16, pp. 35–43, 1969. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. Y. Dai, J. Han, G. Liu, D. Sun, H. Yin, and Y.-X. Yuan, “Convergence properties of nonlinear conjugate gradient methods,” SIAM Journal on Optimization, vol. 10, no. 2, pp. 345–358, 2000. View at Publisher · View at Google Scholar · View at MathSciNet
  5. W. W. Hager and H. C. 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
  6. G. Zoutendijk, “Nonlinear programming, computational methods,” in Integer and Nonlinear Programming, Jabadie, Ed., pp. 37–86, North-Holland, Amsterdam, The Netherlands, 1970. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. 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
  8. 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 Zentralblatt MATH · View at MathSciNet
  9. Y. H. Dai and Y. Yuan, Nonlinear Conjugate Gradient Method, Shanghai science and Technology Press, 2000.
  10. 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
  11. G. H. Liu, J. Y. Han, and H. X. Yin, “Global convergence of the Fletcher-Reeves algorithm with inexact linesearch,” Applied Mathematics, vol. 10, no. 1, pp. 75–82, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. Y. H. Dai and Y. Yuan, “Convergence properties of the Fletcher-Reeves method,” IMA Journal of Numerical Analysis, vol. 16, no. 2, pp. 155–164, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. 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
  14. G. Li, C. Tang, and Z. Wei, “New conjugacy condition and related new conjugate gradient methods for unconstrained optimization,” Journal of Computational and Applied Mathematics, vol. 202, no. 2, pp. 523–539, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. Z. X. Wei, G. Y. Li, and L. Q. Qi, “Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems,” Mathematics of Computation, vol. 77, no. 264, pp. 2173–2193, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. G. Yu, L. Guan, and G. Li, “Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property,” Journal of Industrial and Management Optimization, vol. 4, no. 3, pp. 565–579, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. L. Grippo and S. Lucidi, “A globally convergent version of the Polak-Ribière conjugate gradient method,” Mathematical Programming, vol. 78, no. 3, pp. 375–391, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. 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
  19. 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
  20. 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 Zentralblatt MATH · View at MathSciNet
  21. H. Huang, S. Yao, and H. Lin, “A new conjugate gradient method based on HS-DY methods,” Journal of Guangxi University of Technology, vol. 4, pp. 63–66, 2008. View at Google Scholar
  22. 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 Zentralblatt MATH · View at MathSciNet
  23. L. Zhang and S. Jian, “Further studies on the Wei-Yao-Liu nonlinear conjugate gradient method,” Applied Mathematics and Computation, vol. 219, no. 14, pp. 7616–7621, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  24. 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 Zentralblatt MATH · View at MathSciNet
  25. 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 Zentralblatt MATH · View at MathSciNet
  26. 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
  27. I. Bongartz, A. R. Conn, N. Gould, and P. L. Toint, “CUTE: constrained and unconstrained testing environment,” ACM Transactions on Mathematical Software, vol. 21, no. 1, pp. 123–160, 1995. View at Google Scholar
  28. 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 Zentralblatt MATH · View at MathSciNet
  29. C. Lemarechal, “A view of line-searches,” in Optimization and Optimal Control, A. Auslander, W. Oettli, and J. Stoer, Eds., vol. 30 of Lecture Notes in Control and Information Science, pp. 59–78, Springer, Berlin, Germany, 1981. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  30. R. Fletcher, Practical Methods of Optimization. Vol. 1: Unconstrained Optimization, John Wiley and Sons, New York, NY, USA, 1989. View at MathSciNet
  31. J. Moré and D. J. Thuente, “line search algorithms with guaranteed sufficient decrease,” ACM Transactions on Mathematical Software, vol. 20, pp. 286–307, 1994. View at Publisher · View at Google Scholar