Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014, Article ID 324181, 14 pages
http://dx.doi.org/10.1155/2014/324181
Research Article

Optimal Algorithms and the BFGS Updating Techniques for Solving Unconstrained Nonlinear Minimization Problems

Department of Civil Engineering, National Taiwan University, Taipei 106-17, Taiwan

Received 5 November 2013; Revised 21 January 2014; Accepted 29 January 2014; Published 12 March 2014

Academic Editor: Jung-Fa Tsai

Copyright © 2014 Chein-Shan Liu. 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. 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 · View at Scopus
  2. M. Raydan, “On the Barzilai and Borwein choice of steplength for the gradient method,” IMA Journal of Numerical Analysis, vol. 13, no. 3, pp. 321–326, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  3. M. Raydan, “The Barzilaiai 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 Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  4. A. Friedlander, J. M. Martinez, B. Molina, and M. Raydan, “Gradient method with retards and generalizations,” SIAM Journal on Numerical Analysis, vol. 36, no. 1, pp. 275–289, 1999. View at Google Scholar · View at MathSciNet · View at Scopus
  5. M. Raydan and B. F. Svaiter, “Relaxed steepest descent and Cauchy-Barzilai-Borwein method,” Computational Optimization and Applications, vol. 21, no. 2, pp. 155–167, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  6. Y. H. Dai, J. Y. Yuan, and Y. Yuan, “Modified two-point stepsize gradient methods for unconstrained optimization,” Computational Optimization and Applications, vol. 22, no. 1, pp. 103–109, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  7. Y. H. Dai and L.-H. Liao, “R-linear convergence of the Barzilai and Borwein gradient method,” IMA Journal of Numerical Analysis, vol. 22, no. 1, pp. 1–10, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  8. Y. H. Dai and Y. Yuan, “Alternate minimization gradient method,” IMA Journal of Numerical Analysis, vol. 23, no. 3, pp. 377–393, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  9. R. Fletcher, “On the Barzilai-Borwein gradient method,” in Optimization and Control with Applications, L. Qi, K. Teo, and X. Yang, Eds., vol. 96 of Applied Optimization, pp. 235–256, Springer, New York, NY, USA, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. Y.-X. Yuan, “A new stepsize for the steepest descent method,” Journal of Computational Mathematics, vol. 24, no. 2, pp. 149–156, 2006. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  11. E. G. Birgin and J. M. Martinez, “A spectral conjugate gradient method for unconstrained optimization,” Applied Mathematics and Optimization, vol. 43, no. 2, pp. 117–128, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  12. N. Andrei, “Scaled conjugate gradient algorithms for unconstrained optimization,” Computational Optimization and Applications, vol. 38, no. 3, pp. 401–416, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  13. N. Andrei, “A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization,” Applied Mathematics Letters, vol. 21, no. 2, pp. 165–171, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  14. N. Andrei, “New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization,” Journal of Computational and Applied Mathematics, vol. 234, no. 12, pp. 3397–3410, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  15. L. Zhang, “A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems,” Journal of Computational and Applied Mathematics, vol. 225, no. 1, pp. 146–157, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  16. S. Babaie-Kafaki, R. Ghanbari, and N. Mahdavi-Amiri, “Two new conjugate gradient methods based on modified secant equations,” Journal of Computational and Applied Mathematics, vol. 234, no. 5, pp. 1374–1386, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  17. Z.-J. Shi and J. Guo, “A new family of conjugate gradient methods,” Journal of Computational and Applied Mathematics, vol. 224, no. 1, pp. 444–457, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  18. W. C. Davidon, “Variable metric method for minimization,” AEC Research Development Report ANL-5990, 1959. View at Google Scholar
  19. R. Fletcher and M. Powell, “A rapidly convergent descent method for minimization,” The Computer Journal, vol. 6, pp. 163–168, 1963. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. C.-S. Liu, “A Jordan algebra and dynamic system with associator as vector field,” International Journal of Non-Linear Mechanics, vol. 35, no. 3, pp. 421–429, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  21. C. G. Broyden, “The convergence of a class of double-rank minimization algorithms: 2. The new algorithm,” Journal of the Institute of Mathematics and its Applications, vol. 6, no. 3, pp. 222–231, 1970. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  22. R. Fletcher, “A new approach to variable metric algorithms,” The Computer Journal, vol. 13, no. 3, pp. 317–322, 1970. View at Google Scholar · View at Scopus
  23. D. Goldfarb, “A family of variable-metric methods derived by variational means,” Mathematics of Computation, vol. 24, pp. 23–26, 1970. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  24. D. F. Shanno, “Conditioning of quasi-Newton methods for function minimization,” Mathematics of Computation, vol. 24, pp. 647–656, 1970. View at Publisher · View at Google Scholar · View at MathSciNet
  25. Y.-H. Dai, “Convergence properties of the BFGS algoritm,” SIAM Journal on Optimization, vol. 13, no. 3, pp. 693–701, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. Y.-H. Dai, “A perfect example for the BFGS method,” Mathematical Programming A, vol. 138, no. 1-2, pp. 501–530, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  27. P. E. Gill, W. Murray, and P. A. Pitfield, “The implementation of two revised quasi-Newton algorithms for unconstrained optimization,” Tech. Rep. NAC-11, National Physical Laboratory, Teddington, UK, 1972. View at Google Scholar
  28. H. H. Rosenbrock, “An automatic method for finding the greatest or least value of a function,” The Computer Journal, vol. 3, no. 3, pp. 175–184, 1960. View at Publisher · View at Google Scholar · View at MathSciNet
  29. H.-C. Kuo, J.-R. Chang, and C.-H. Liu, “Particle swarm optimization for global optimization problems,” Journal of Marine Science and Technology, vol. 14, no. 3, pp. 170–181, 2006. View at Google Scholar · View at Scopus
  30. C.-S. Liu and S. N. Atluri, “A fictitious time integration method (FTIM) for solving mixed complementarity problems with applications to non-linear optimization,” Computer Modeling in Engineering & Sciences, vol. 34, no. 2, pp. 155–178, 2008. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  31. P. Bouvry, F. Arbab, and F. Seredynski, “Distributed evolutionary optimization, in Manifold: Rosenbrock's function case study,” Information Sciences, vol. 122, no. 2–4, pp. 141–159, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  32. S. Kok and C. Sandrock, “Locating and characterizing the stationary points of the extended Rosenbrock function,” Evolutionary Computation, vol. 17, no. 3, pp. 437–453, 2009. View at Publisher · View at Google Scholar · View at Scopus
  33. M. J. D. Powell, “An iterative method for finding stationary values of a function of several variables,” The Computer Journal, vol. 5, no. 2, pp. 147–151, 1962. View at Publisher · View at Google Scholar · View at Zentralblatt MATH