Skip to main content
Log in

Nonmonotonic trust region algorithm

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

A nonmonotonic trust region method for unconstrained optimization problems is presented. Although the method allows the sequence of values of the objective function to be nonmonotonic, convergence properties similar to those for the usual trust region method are proved under certain conditions, including conditions on the approximate solutions to the subproblem. To make the solution satisfy these conditions, an algorithm to solve the subproblem is also established. Finally, some numerical results are reported which show that the nonmonotonic trust region method is superior to the usual trust region method according to both the number of gradient evaluations and the number of function evaluations.

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. Chamberlain, R. M., Powell, M. J. D., Lemarechal, C., andPedersen, H. C.,The Watchdog Technique for Forcing Convergence in Algorithms for Constrained Optimization, Mathematical Programming Study, Vol. 26, pp. 1–17, 1986.

    Google Scholar 

  2. Grippo, L., Lampariello, F., andLucidi, S.,A Nonmonotone Line Search Technique for Newton's Methods, SIAM Journal on Numerical Analysis, Vol. 23, pp. 707–716, 1986.

    Google Scholar 

  3. Grippo, L., Lampariello, F., andLucidi, S.,A Truncated Newton Method with Nonmonotone Line Search for Unconstrained Optimization, Journal of Optimization Theory and Applications, Vol. 60, pp. 401–419, 1989.

    Google Scholar 

  4. More, J. J.,Recent Development in Algorithms and Software for Trust Region Methods, Mathematical Programming: The State of the Art, Edited by A. Bachem, M. Grotschel, and B. Kortz, Springer-Verlag, Berlin, Germany, pp. 258–287, 1983.

    Google Scholar 

  5. Shultz, G. A., Schnabel, R. B., andByrd, R. H.,A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties, SIAM Journal on Numerical Analysis, Vol. 22, pp. 47–67, 1985.

    Google Scholar 

  6. Powell, M. J. D.,Convergence Properties of a Class of Minimization Algorithms, Nonlinear Programming 2, Edited by O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, Academic Press, New York, New York, pp. 1–27, 1975.

    Google Scholar 

  7. Sorensen, D. C.,Newton's Method with a Model Trust Region Modification, SIAM Journal on Numerical Analysis, Vol. 19, pp. 409–426, 1982.

    Google Scholar 

  8. Steihaug, T.,The Conjugate Gradient Method and Trust Regions in Large-Scale Optimization, SIAM Journal on Numerical Analysis, Vol. 20, pp. 626–637, 1983.

    Google Scholar 

  9. Dennis, J. E., Jr., andMei, H. H. W.,Two New Unconstrained Optimization Algorithms Which Use Function and Gradient Values, Journal of Optimization Theory and Applications, Vol. 28, pp. 453–482, 1979.

    Google Scholar 

  10. Dennis, J. E., Jr., andSchnabel, R. B.,Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, New Jersey, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by L. C. W. Dixon

The authors would like to thank Professor L. C. W. Dixon for his useful suggestions.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Deng, N.Y., Xiao, Y. & Zhou, F.J. Nonmonotonic trust region algorithm. J Optim Theory Appl 76, 259–285 (1993). https://doi.org/10.1007/BF00939608

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00939608

Key Words

Navigation