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

Sufficient Descent Polak-Ribière-Polyak Conjugate Gradient Algorithm for Large-Scale Box-Constrained Optimization

1College of Software, Henan University, Kaifeng 475000, China
2College of Mathematics and Information Science, Henan University, Kaifeng 475000, China

Received 7 December 2013; Accepted 14 February 2014; Published 13 April 2014

Academic Editor: Gaohang Yu

Copyright © 2014 Qiuyu Wang and Yingtao Che. 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. N. Gould, D. Orban, and P. Toint, “Numerical methods for large-scale nonlinear optimization,” Acta Numerica, vol. 14, pp. 299–361, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. D. G. Luenberger, Introduction to Linear and Nonlinear Programming, chapter 11, Addison-Wesley, Reading, Mass, USA, 1973.
  3. F. Facchinei, J. Júdice, and J. Soares, “An active set Newton algorithm for large-scale nonlinear programs with box constraints,” SIAM Journal on Optimization, vol. 8, no. 1, pp. 158–186, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. E. G. Birgin and J. M. Martínez, “Large-scale active-set box-constrained optimization method with spectral projected gradients,” Computational Optimization and Applications, vol. 23, no. 1, pp. 101–125, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. F. Facchinei, S. Lucidi, and L. Palagi, “A truncated Newton algorithm for large scale box constrained optimization,” SIAM Journal on Optimization, vol. 12, no. 4, pp. 1100–1125, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. W. W. Hager and H. Zhang, “A new active set algorithm for box constrained optimization,” SIAM Journal on Optimization, vol. 17, no. 2, pp. 526–557, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. Q. Ni and Y. Yuan, “A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization,” Mathematics of Computation, vol. 66, no. 220, pp. 1509–1520, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. D. P. Bertsekas, “Projected Newton methods for optimization problems with simple constraints,” SIAM Journal on Control and Optimization, vol. 20, no. 2, pp. 221–246, 1982. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. W. W. Hager and H. Zhang, “A survey of nonlinear conjugate gradient methods,” Pacific Journal of Optimization, vol. 2, no. 1, pp. 35–58, 2006. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. 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
  11. J. Zhang, Y. Xiao, and Z. Wei, “Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization,” Mathematical Problems in Engineering, vol. 2009, Article ID 243290, 16 pages, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. 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
  13. L. Zhang, Nonlinear conjugate gradient methods for optimization problems [Ph.D. thesis], College of Mathematics and Econometrics, Hunan University, Hunan, China, 2006.
  14. L. Qi, X. J. Tong, and D. H. Li, “Active-set projected trust-region algorithm for box-constrained nonsmooth equations,” Journal of Optimization Theory and Applications, vol. 120, no. 3, pp. 601–625, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. Y. Xiao and D.-H. Li, “An active set limited memory BFGS algorithm for large-scale bound constrained optimization,” Mathematical Methods of Operations Research, vol. 67, no. 3, pp. 443–454, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. Y. Xiao and Q. Hu, “Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization,” Applied Mathematics and Optimization, vol. 58, no. 2, pp. 275–290, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. Y.-H. Xiao, Q.-J. Hu, and Z. Wei, “Modified active set projected spectral gradient method for bound constrained optimization,” Applied Mathematical Modelling, vol. 35, no. 7, pp. 3117–3127, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. Y.-F. Yang, D.-H. Li, and L. Qi, “A feasible sequential linear equation method for inequality constrained optimization,” SIAM Journal on Optimization, vol. 13, no. 4, pp. 1222–1244, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. 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 Publisher · View at Google Scholar · View at Scopus
  20. R. H. Byrd, P. Lu, J. Nocedal, and C. Y. Zhu, “A limited memory algorithm for bound constrained optimization,” SIAM Journal on Scientific Computing, vol. 16, no. 5, pp. 1190–1208, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  21. C. Zhu, R. H. Byrd, P. Lu, and J. Nocedal, “Algorithm 778: L-BFGS-B: fortran subroutines for large-scale bound-constrained optimization,” ACM Transactions on Mathematical Software, vol. 23, no. 4, pp. 550–560, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  22. 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