Skip to main content
SpringerLink
Log in

Two accelerated nonmonotone adaptive trust region line search methods

  • Original Paper
  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

Hybridizing monotone and nonmonotone approaches, we employ a modified trust region ratio in which more information is provided about the agreement between the exact and the approximate models. Also, we use an adaptive trust region radius as well as two accelerated Armijo-type line search strategies to avoid resolving the trust region subproblem whenever a trial step is rejected. We show that the proposed algorithm is globally and locally superlinearly convergent. Comparative numerical experiments show practical efficiency of the proposed accelerated adaptive trust region algorithm.

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

Access this article

Log in via an institution

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. Ahookhoosh, M., Amini, K.: A nonmonotone trust region method with adaptive radius for unconstrained optimization problems. Comput. Math. Appl. 60 (3), 411–442 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ahookhoosh, M., Amini, K., Peyghami, M.: A nonmonotone trust region line search method for large scale unconstrained optimization. Appl. Math. Model. 36(1), 478–487 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  3. Andrei, N.: An acceleration of gradient descent algorithm with backtracking for unconstrained optimization. Numer. Algorithms 42(1), 63–73 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Babaie–Kafaki, S.: On optimality of the parameters of self–scaling memoryless quasi–Newton updating formulae. J. Optim. Theory Appl. 167(1), 91–101 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  5. Dolan, E.D., Moré, J.J.: Benchmarking optimization software with performance profiles. Math. Programming 91(2, Ser. A), 201–213 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  6. Fu, J.H., Sun. W.Y.: Nonmonotone adaptive trust region method for unconstrained optimization problems. Appl. Math. Comput. 163(1), 489–504 (2005)

    MathSciNet  MATH  Google Scholar 

  7. Gould, N.I.M., Orban, D., Toint, P.h.L.: CUTER: a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29(4), 373–394 (2003)

    Article  MATH  Google Scholar 

  8. 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 

  9. Hager, W.W., Zhang, H.: Algorithm 851: CG_descent, a conjugate gradient method with guaranteed descent. ACM Trans. Math. Softw. 32(1), 113–137 (2006)

    Article  MATH  Google Scholar 

  10. Kamandi, A., Amini, K., Ahookhoosh, M.: An improved adaptive trust region algorithm. Optim. Lett. 10(2), 1–15 (2016)

    Google Scholar 

  11. Li, D.: A trust region method with automatic determination of the trust region radius. Chinese J. Eng. Math. (Gongcheng Shuxue Xuebao) 23(5), 843–848 (2006)

    MathSciNet  MATH  Google Scholar 

  12. Nocedal, J.: Conjugate gradient methods and nonlinear optimization. In: Linear and Nonlinear Conjugate Gradient–Related Methods (Seattle, WA, 1995), pp. 9–23. SIAM, Philadelphia (1996)

  13. Oren, S.S., Luenberger, D.G.: Self–scaling variable metric (SSVM) algorithms. I. Criteria and sufficient conditions for scaling a class of algorithms. Management Sci. 20(5), 845–862 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  14. Oren, S.S., Spedicato, E.: Optimal conditioning of self–scaling variable metric algorithms. Math. Programming 10(1), 70–90 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  15. Shi, Z., Wang, S.: Nonmonotone adaptive trust region method. European J. Oper. Res. 208(1), 28–36 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  16. Shi, Z.J., Guo, J.H.: A new trust region method for unconstrained optimization. J. Comput. Appl. Math. 213(1), 509–520 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  17. Sun, W., Han, J., Sun, J.: On global convergence of nonmonotone descent methods. J. Comput. Appl. Math. 146(1), 89–98 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  18. Sun, W., Yuan, Y.X.: Optimization Theory and Methods: Nonlinear Programming. Springer, New York (2006)

    MATH  Google Scholar 

  19. Toint, P.h.L.: Global convergence of the partitioned BFGS algorithm for convex partially separable optimization. Math. Programming 36(3), 290–306 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  20. Toint, P.h.L.: Nonmonotone trust region algorithms for nonlinear optimization subject to convex constraints. SIAM J. Sci. Comput. 17(3), 725–739 (1996)

    Article  MathSciNet  Google Scholar 

  21. Wan, Z., Huang, S., Zheng, X.D.: New cautious BFGS algorithm based on modified Armijo–type line search. J Inequal. Appl. 2012(1), 1–10 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  22. Zhang, H., 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 

  23. Zhang, L., Zhou, W., Li, D.H.: A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence. IMA J. Numer. Anal. 26(4), 629–640 (2006)

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This research was in part supported by the grant 95849086 from Iran National Science Foundation (INSF), and in part by the Research Council of Semnan University. The authors thank the anonymous reviewer for his/her valuable comments and suggestions helped to improve the presentation.

Author information

Authors and Affiliations

  1. Department of Mathematics, Faculty of Mathematics, Statistics and Computer Science, Semnan University, P.O. Box: 35195-363, Semnan, Iran

    Saman Babaie–Kafaki & Saeed Rezaee

Authors
  1. Saman Babaie–Kafaki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Saeed Rezaee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Saman Babaie–Kafaki.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Babaie–Kafaki, S., Rezaee, S. Two accelerated nonmonotone adaptive trust region line search methods. Numer Algor 78, 911–928 (2018). https://doi.org/10.1007/s11075-017-0406-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11075-017-0406-x

Keywords

Mathematics Subject Classification (2010)

Search

Navigation