Skip to main content
Log in

On an Efficient Use of Gradient Information for Accelerating Interval Global Optimization Algorithms

  • Published:
Numerical Algorithms Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

This paper analyzes and evaluates an efficient n-dimensional global optimization algorithm. It is a natural n-dimensional extension of the algorithm of Casado et al. [1]. This algorithm takes advantage of all available information to estimate better bounds of the function. Numerical comparison made on a wide set of multiextremal test functions has shown that on average the new algorithm works faster than a traditional interval analysis global optimization method.

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. L.G. Casado, I. García, J.A. Martínez and Ya.D. Sergeyev, New interval analysis support functions using gradient information in a global minimization algorithm, J. Global Optimization 25(4) (2003) 1–18.

    Google Scholar 

  2. T. Csendes and D. Ratz, Subdivision direction selection in interval methods for global optimization, SIAM J. Numer. Anal. 34 (1997) 922–938.

    Google Scholar 

  3. L.W.C. Dixon and G.P. Szego, eds., Towards Global Optimization (North-Holland, Amsterdam, 1975).

    Google Scholar 

  4. L.W.C. Dixon and G.P. Szego, eds., Towards Global Optimization 2 (North-Holland, Amsterdam, 1978).

    Google Scholar 

  5. R. Hammer, M. Hocks, U. Kulisch and D. Ratz, C++ Toolbox for Verified Computing I: Basic Numerical Problems: Theory, Algorithms, and Programs (Springer, Berlin, 1995).

    Google Scholar 

  6. T. Henriksen and K. Madsen: Use of a depth-first strategy in parallel Global Optimization, Technical Report 92–10, Institute for Numerical Analysis, Technical University of Denmark (1992).

  7. R.B. Kearfott, Rigorous Global Search: Continuous Problems (Kluwer Academic, Dordrecht, 1996).

    Google Scholar 

  8. R. Moore, Interval Analysis (Prentice-Hall, Englewood Cliffs, NJ, 1966).

    Google Scholar 

  9. A. Neumaier, Interval Methods for Systems of Equations (Cambridge Univ. Press, Cambridge, 1990).

    Google Scholar 

  10. H. Ratschek and J. Rokne, New Computer Methods for Global Optimization (Ellis Horwood, Chichester, 1988).

    Google Scholar 

  11. D. Ratz, Automatic Slope Computation and its Application in Nonsmooth Global Optimization (Shaker Verlag, Aachen, 1998).

    Google Scholar 

  12. D. Ratz and T. Csendes, On the selection of subdivision directions in interval branch and bound methods for global optimization, J. Global Optimization 7 (1995), 183–207.

    Google Scholar 

  13. A. Törn and A. Žilinskas, Global Optimization, Lecture Notes in Computer Science, Vol. 350 (Springer, Berlin, 1989).

    Google Scholar 

  14. G. Walster, E. Hansen and S. Sengupta, Test results for global optimization algorithm, in: SIAM Numerical Optimization 1984 (SIAM, Philadelphia, PA) pp. 272–287.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Martínez, J., Casado, L., García, I. et al. On an Efficient Use of Gradient Information for Accelerating Interval Global Optimization Algorithms. Numerical Algorithms 37, 61–69 (2004). https://doi.org/10.1023/B:NUMA.0000049456.81410.fc

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:NUMA.0000049456.81410.fc

Navigation