Skip to main content
Log in

A new non-monotone self-adaptive trust region method for unconstrained optimization

  • Published:
Journal of Applied Mathematics and Computing Aims and scope Submit manuscript

Abstract

In this paper, based on a simple model of trust region sub-problem, we combine the trust region method with the non-monotone and self-adaptive techniques to propose a new non-monotone self-adaptive trust region algorithm for unconstrained optimization. By use of the simple model, the new method needs less memory capacitance, computational complexity and CPU time. The convergence results of the method are proved under certain conditions. Numerical results show that the new method is effective and attractive for large-scale optimization problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Powell, M.J.D.: A new algorithm for unconstrained optimization. In: Rosen, J.B., Mangasarian, O.L., Ritter, K. (eds.) Nonlinear Programming, pp. 31–65. Academic Press, New York (1970)

    Google Scholar 

  2. Nocedal, J., Yuan, Y.X.: Combining trust region and line search techniques. In: Yuan, Y. (ed.) Advances in Nonlinear Programming, pp. 153–175. Kluwer, Dordrecht (1998)

    Google Scholar 

  3. Schultz, G.A., Schnabel, R.B., Byrd, R.H.: A family of trust-region-based algorithms for un-constrained minimization with strong global convergence. SIAM J. Numer. Anal. 22, 47–67 (1985)

    Article  MathSciNet  Google Scholar 

  4. Steihaug, T.: The conjugate gradient method and trust regions in large scale optimization. SIAM J. Numer. Anal. 20, 626–637 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  5. Grippo, L., Lemparieello, F., Lucidi, S.: A non-monotone line search technique for Newton’s method. SIAM J. Numer. Anal. 23, 707–716 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  6. Deng, N.Y., Xiao, Y., Zhou, F.J.: Nonmonotonic trust region algorithm. J. Optim. Theory Appl. 76, 259–285 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  7. Toint, Ph.L.: Non-monotone trust region algorithms for nonlinear optimization subject to convex constraints. Math. Program. 77, 69–94 (1997)

    MATH  MathSciNet  Google Scholar 

  8. Zhang, X.S., Zhang, J.L., Liao, L.Z.: An adaptive trust region method and its convergence. Sci. China (Ser. A) 45, 620–631 (2002)

    MATH  MathSciNet  Google Scholar 

  9. Li, G.D.: A trust region method with automatic determination of the trust region radius. Chin. J. Eng. Math. 23, 843–848 (2006)

    MATH  Google Scholar 

  10. Powell, M.J.D.: Convergence properties of a class of minimization algorithms. In: Mangasarian, O.L., Meyer, R.R., Robinson, S.M. (eds.) Nonlinear Programming, vol. 2, pp. 1–27. Academic Press, New York (1975)

    Google Scholar 

  11. Shi, Z.J., Shen, J.: New inexact line search method for unconstrained optimization. J. Optim. Theory Appl. 127, 425–446 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  12. Touati-Ahmed, D., Storey, C.: Efficient hybrid conjugate gradient techniques. J. Optim. Theory Appl. 64, 379–397 (1990)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhaoyang Sang.

Additional information

This work is supported by the National Natural Science Foundation of China (10571106).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sang, Z., Sun, Q. A new non-monotone self-adaptive trust region method for unconstrained optimization. J. Appl. Math. Comput. 35, 53–62 (2011). https://doi.org/10.1007/s12190-009-0339-1

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12190-009-0339-1

Keywords

Mathematics Subject Classification (2000)

Navigation