Table of Contents Author Guidelines Submit a Manuscript
Journal of Optimization
Volume 2014, Article ID 237279, 8 pages
http://dx.doi.org/10.1155/2014/237279
Research Article

A Nonmonotone Adaptive Trust Region Method Based on Conic Model for Unconstrained Optimization

Department of Mathematics and Physics, Shandong Jiaotong University, Ji’nan, Shandong Province 250023, China

Received 20 August 2013; Accepted 29 November 2013; Published 27 January 2014

Academic Editor: Adil M. Bagirov

Copyright © 2014 Zhaocheng 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. M. J. D. Powell, “Convergence properties of a class of minimization algorithms,” in Nonlinear Programming, J. B. Rosen, O. L. Mangasarian, and K. Ritter, Eds., pp. 1–27, Academic press, New York, NY, USA, 1975. View at Google Scholar
  2. Y. Yuan, “On the convergence of trust region algorithms,” Mathematica Numerica Sinica, vol. 16, pp. 333–346, 1996. View at Google Scholar
  3. J. Nocedal and Y. Yuan, “Combining trust region and line search techniquesAdvances in Nonlinear Programming,” Y. Yuan, Ed., pp. 153–175, Kluwer Academic, Dordrecht, The Netherlands, 1996. View at Google Scholar
  4. M. J. D. Powell, “A new algorithm for unconstrained optimization,” in Nonlinear Programming, J. B. Rosen, O. L. Mangassarian, and K. Ritter, Eds., pp. 31–65, Academic press, New York, NY, USA, 1970. View at Google Scholar
  5. M. J. D. Powell, “On the global convergence of trust region algorithms for unconstrained optimization,” Mathematical Programming, vol. 29, no. 3, pp. 297–303, 1984. View at Google Scholar · View at Scopus
  6. T. Steilhaug, “The conjugate gradient method and trust region in large scale optimization,” SIAM Journal on Numerical Analysis, vol. 20, pp. 626–637, 1983. View at Google Scholar
  7. E. M. Gertz, “A quasi-Newton trust-region method,” Mathematical Programming A, pp. 1–24, 1963. View at Google Scholar
  8. A. R. Conn, N. I. M. Gould, and P. L. Toint, Trust-Region Methods, Society for Industrial and Applied Mathematics, Philadelphia, Pa, USA, 2000.
  9. J. Nocedal and S. J. Wright, Numerical Optimization, Springer, New York, NY, USA, 1999.
  10. Y. X. Yuan and W. Y. Sun, Optimization Theory and Methods, Science Press, Beijing, China, 1997.
  11. L. Grippo, F. Lampariello, and S. Lucidi, “A nonmonotone line search technique for Newton's method,” SIAM Journal on Numerical Analysis, vol. 23, no. 4, pp. 707–716, 1986. View at Google Scholar
  12. N. Y. Deng, Y. Xiao, and F. J. Zhou, “Nonmonotonic trust region algorithm,” Journal of Optimization Theory and Applications, vol. 76, no. 2, pp. 259–285, 1993. View at Publisher · View at Google Scholar · View at Scopus
  13. W. Y. Sun, “Nonmonotone trust region method for solving optimization problems,” Applied Mathematics and Computation, vol. 156, no. 1, pp. 159–174, 2004. View at Publisher · View at Google Scholar · View at Scopus
  14. P. L. Toint, “Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints,” Mathematical Programming B, vol. 77, no. 1, pp. 69–94, 1997. View at Google Scholar · View at Scopus
  15. J. T. Mo, C. Y. Liu, and S. C. Yan, “A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values,” Journal of Computational and Applied Mathematics, vol. 209, no. 1, pp. 97–108, 2007. View at Publisher · View at Google Scholar · View at Scopus
  16. X. Ke and J. Han, “A class of nonmonotone trust region algorithms for unconstrained optimization problems,” Science in China A, vol. 41, no. 9, pp. 927–932, 1998. View at Google Scholar · View at Scopus
  17. A. Sartenaer, “Automatic determination of an initial trust region in nonlinear programming,” SIAM Journal on Scientific Computing, vol. 18, no. 6, pp. 1788–1803, 1997. View at Google Scholar · View at Scopus
  18. J. Y. Fan and Y. X. Yuan, “A new trust region algorithm with trust region radius converging to zero,” in Proceedings of the 5th International Conference on Optimization: Techniques and Applications, Hong Kong, China, December 2001.
  19. X. S. Zhang, J. L. Zhang, and L. Z. Liao, “An adaptive trust region method and its convergence,” Science in China A, vol. 45, no. 5, pp. 620–631, 2002. View at Google Scholar · View at Scopus
  20. Z. Y. Sang and Q. Y. Sun, “A self-adaptive trust region method with line search based on a simple subproblem model,” Journal of Computational and Applied Mathematics, vol. 232, no. 2, pp. 514–522, 2009. View at Publisher · View at Google Scholar · View at Scopus
  21. L. Hei, “A self-adaptive trust region algorithm,” Journal of Computational Mathematics, vol. 21, pp. 229–236, 2003. View at Google Scholar
  22. G. D. Li, “A trust region method with automatic determination of the trust region radius,” Chinese Journal of Engineering Mathematicss, vol. 23, pp. 843–848, 2006. View at Google Scholar
  23. Z. J. Shi and J. H. Guo, “A new trust region method for unconstrained optimization,” Applied Mathematics and Computation, vol. 213, pp. 509–520, 2008. View at Google Scholar
  24. J. L. Zhang and X. S. Zhang, “A nonmonotone adapyive trust region method and its convergence,” Computers and Mathematics with Application, vol. 45, pp. 1469–1477, 2003. View at Google Scholar
  25. W. C. Davidon, “Conic approximation and collinear scaling for optimizers,” SIAM Journal on Numerical Analysis, vol. 17, pp. 268–281, 1980. View at Google Scholar
  26. S. Di and W. Y. Sun, “A trust region method for conic model to solve unconstrained optimization,” Optimization Methods and Software, vol. 6, no. 4, pp. 237–263, 1996. View at Google Scholar · View at Scopus
  27. Q. Ni, “Optimality conditions for trust-region subproblems involving a conic model,” SIAM Journal on Optimization, vol. 15, no. 3, pp. 826–837, 2005. View at Publisher · View at Google Scholar · View at Scopus
  28. S.-J. Qu, K.-C. Zhang, and J. Zhang, “A nonmonotone trust-region method of conic model for unconstrained optimization,” Journal of Computational and Applied Mathematics, vol. 220, no. 1-2, pp. 119–128, 2008. View at Publisher · View at Google Scholar · View at Scopus
  29. W. Sun, “On nonquadratic model optimization methods,” Asia and Pacific Journal of Operational Research, vol. 13, pp. 43–63, 1996. View at Google Scholar
  30. H. Gourgeon and J. Nocedal, “A Conic algorithm for optimization,” SIAM Journal of Scientific Stochastical Computation, vol. 6, pp. 253–267, 1985. View at Google Scholar
  31. W. Y. Sun and Y. X. Yuan, “A conic trust-region method for nonlinearly constrained optimization,” Annal of Operational Research, vol. 103, pp. 175–191, 2001. View at Google Scholar
  32. S. Sheng, “Interpolation by conic model for unconstrained optimization,” Computing, vol. 54, pp. 83–98, 1995. View at Google Scholar
  33. Z. S. Yu and D. G. Pu, “A new nonmonotone line search technique for unconstrained optimization,” Journal of Computational and Applied Mathematics, vol. 219, no. 1, pp. 134–144, 2008. View at Publisher · View at Google Scholar · View at Scopus
  34. X. P. Lu and Q. Ni, “A quasi-Newton trust region method with a new conic model for the unconstrained optimization,” Applied Mathematics and Computation, vol. 204, no. 1, pp. 373–384, 2008. View at Publisher · View at Google Scholar · View at Scopus
  35. J. J. Moré, B. S. Grabow, and K. E. Hillstrom, “Testing unconstrained optimization software,” ACM Transactions on Mathematical Software, vol. 7, pp. 17–41, 1981. View at Google Scholar