About this Journal Submit a Manuscript Table of Contents
Abstract and Applied Analysis
Volume 2014 (2014), Article ID 940120, 7 pages
http://dx.doi.org/10.1155/2014/940120
Research Article

A New Method with Sufficient Descent Property for Unconstrained Optimization

College of Mathematics and Physics, Bohai University, Jinzhou 121000, China

Received 14 September 2013; Revised 21 December 2013; Accepted 4 January 2014; Published 13 February 2014

Academic Editor: Adrian Petrusel

Copyright © 2014 Weiyi Qian and Haijuan Cui. 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. 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
  2. K. Ueda and N. Yamashita, “Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization,” Applied Mathematics and Optimization, vol. 62, no. 1, pp. 27–46, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. M. Raydan, “The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem,” SIAM Journal on Optimization, vol. 7, no. 1, pp. 26–33, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. Y. Xiao, Z. Wei, and Z. Wang, “A limited memory BFGS-type method for large-scale unconstrained optimization,” Computers & Mathematics with Applications, vol. 56, no. 4, pp. 1001–1009, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. 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
  6. D.-H. Li and B.-S. Tian, “n-step quadratic convergence of the MPRP method with a restart strategy,” Journal of Computational and Applied Mathematics, vol. 235, no. 17, pp. 4978–4990, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. 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
  8. J. Barzilai and J. M. Borwein, “Two-point step size gradient methods,” IMA Journal of Numerical Analysis, vol. 8, no. 1, pp. 141–148, 1988. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. W. Cheng, “A two-term PRP-based descent method,” Numerical Functional Analysis and Optimization, vol. 28, no. 11-12, pp. 1217–1230, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. M.-L. Zhang, Y.-H. Xiao, and D. Zhou, “A simple sufficient descent method for unconstrained optimization,” Mathematical Problems in Engineering, vol. 2010, Article ID 684705, 9 pages, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. 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
  12. X.-M. An, D.-H. Li, and Y. Xiao, “Sufficient descent directions in unconstrained optimization,” Computational Optimization and Applications, vol. 48, no. 3, pp. 515–532, 2011, Supplementary material available online. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. Z. Dai, “Two modified Polak-Ribière-Polyak-type nonlinear conjugate methods with sufficient descent property,” Numerical Functional Analysis and Optimization, vol. 31, no. 7–9, pp. 892–906, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. Z. Wan, C. Hu, and Z. Yang, “A spectral PRP conjugate gradient methods for nonconvex optimization problem based on modified line search,” Discrete and Continuous Dynamical Systems B, vol. 16, no. 4, pp. 1157–1169, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. 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
  16. N. Andrei, “An unconstrained optimization test functions collection,” Advanced Modeling and Optimization, vol. 10, no. 1, pp. 147–161, 2008. View at Zentralblatt MATH · View at MathSciNet
  17. 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