Skip to main content
Log in

A retrospective trust-region method for unconstrained optimization

  • FULL LENGTH PAPER
  • Series A
  • Published:
Mathematical Programming Submit manuscript

Abstract

We introduce a new trust-region method for unconstrained optimization where the radius update is computed using the model information at the current iterate rather than at the preceding one. The update is then performed according to how well the current model retrospectively predicts the value of the objective function at last iterate. Global convergence to first- and second-order critical points is proved under classical assumptions and preliminary numerical experiments on CUTEr problems indicate that the new method is very competitive.

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. Bastin F., Cirillo C., Toint Ph.L.: An adaptive Monte-Carlo algorithm for computing mixed logit estimators. Comput. Manage. Sci. 3(1), 55–80 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bastin F., Cirillo C., Toint Ph.L.: Application of an adaptive Monte-Carlo algorithm to mixed logit estimation. Transp. Res. B 40(7), 577–593 (2006)

    Article  Google Scholar 

  3. Conn A.R., Gould N.I.M., Toint Ph.L.: Trust-Region Methods. Number 01 in ‘MPS-SIAM Series on Optimization’. SIAM, Philadelphia (2000)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Moré J.J., Sorensen D.C.: Computing a trust region step. SIAM J. Sci. Stat. Comput. 4(3), 553–572 (1983)

    Article  MATH  Google Scholar 

  7. Robinson S.M.: Analysis of sample-path optimization. Math. Oper. Res. 21(3), 513–528 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  8. Shapiro A.: Monte Carlo sampling methods. In: Shapiro, A., Ruszczyński, A. (eds) Stochastic Programming, vol. 10 of Handbooks in Operations Research and Management Science, pp. 353–425. Elsevier, Amsterdam (2003)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  10. Toint Ph.L.: Towards an efficient sparsity exploiting Newton method for minimization. In: Duff, I.S. (eds) Sparse Matrices and Their Uses, pp. 57–88. Academic Press, London (1981)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fabian Bastin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bastin, F., Malmedy, V., Mouffe, M. et al. A retrospective trust-region method for unconstrained optimization. Math. Program. 123, 395–418 (2010). https://doi.org/10.1007/s10107-008-0258-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-008-0258-1

Keywords

Mathematics Subject Classification (2000)

Navigation