Skip to main content
Log in

A new modified nonmonotone adaptive trust region method for unconstrained optimization

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

In this paper, we present an adaptive trust region method for solving unconstrained optimization problems which combines nonmonotone technique with a new update rule for the trust region radius. At each iteration, our method can adjust the trust region radius of related subproblem. We construct a new ratio to adjust the next trust region radius which is different from the ratio in the traditional trust region methods. The global and superlinear convergence results of the method are established under reasonable assumptions. Numerical results show that the new method is efficient for unconstrained 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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Conn, A.R., Gould, N.I.M., Toint Ph, L.: Trust-Region Methods. Society for Industrial and Applied Mathematics, SIAM, Philadelphia (2000)

    Book  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Fan, J.Y., Yuan, Y.X.: A new trust region algorithm with trust region radius converging to zero. In: Proceedings of the 5th International Conference on Optimization: Techniques and Applications [C], Hong Kong (2001)

    Google Scholar 

  4. Gertz, E.M.: A quasi-Newton trust-region method. Math. Program. Ser A, 1–24 (1963)

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Ke, X.W., Han, J.Y.: A class of nonmonotone trust region algorithms for unconstrained optimization. Sci. China Ser. A 41(9), 927–932 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  7. Mo, J.T., Liu, C.Y., Yan, S.C.: A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values. J. Comput. Appl. Math. 209, 97–108 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Moré, J.J., Grabow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7, 17–41 (1981)

    Article  MATH  Google Scholar 

  9. Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (1999)

    Book  MATH  Google Scholar 

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

    Chapter  Google Scholar 

  11. Powell, M.J.D.: Convergence properties of a class of minimization algorithms. In: Rosen, J.B., Mangasarian, O.L., Ritter, K. (eds.) Nonlinear Programming, pp. 1–27. Academic Press, New York (1975)

    Google Scholar 

  12. Powell, M.J.D.: On the global convergence of trust region algorithms for unconstrained optimization. Math. Program. 29, 297–303 (1984)

    Article  MATH  Google Scholar 

  13. Qu, S.J., Zhang, K.C., Zhang, J.: A nonmonotone trust region method of conic model for unconstrained optimization. J. Comput. Appl. Math. 220, 119–128 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  14. Sartenaer, A.: Automatic determination of an initial trust region in nonlinear programming. SIAM J. Sci. Comput. 18(6), 1788–1803 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  15. Schnable, R.B., Eskow, E.: A new modified Cholesky factorization. SIAM J. Sci. Stat. Comput. 11, 1136–1158 (1990)

    Article  Google Scholar 

  16. Shultz, G.A., Schnabel, R.B., Byrd, A.R.H.: A family of trust-region-based algorithm for unconstrained minimization with strong global convergence properties. SIAM J. Numer. Anal. 22(1), 47–67 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  17. Sun, W.Y.: Nonmonotone trust region method for solving optimization problems. Appl. Math. Comput. 156, 159–174 (2004)

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  19. Yuan, Y.X.: On the convergence of trust region algorithms. Math. Numer. Sin. 16, 333–346 (1996)

    Google Scholar 

  20. Yuan, Y.X., Sun, W.Y.: Optimization Theory and Methods. Science Press, Beijing (1997)

    Google Scholar 

  21. Zhang, H.C., Hager, W.W.: A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim. 14(4), 1043–1056 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  22. 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)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the editor and the reviewers for their insightful and constructive comments, which help to enrich the content and improve the presentation of this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhaocheng Cui.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cui, Z., Wu, B. A new modified nonmonotone adaptive trust region method for unconstrained optimization. Comput Optim Appl 53, 795–806 (2012). https://doi.org/10.1007/s10589-012-9460-4

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-012-9460-4

Keywords

Navigation