Skip to main content
Log in

Convergence rates of a global optimization algorithm

  • Published:
Mathematical Programming Submit manuscript

Abstract

This paper presents a best and worst case analysis of convergence rates for a deterministic global optimization algorithm. Superlinear convergence is proved for Lipschitz functions which are convex in the direction of the global maximum (concave in the direction of the global minimum). Computer results are given, which confirm the theoretical convergence rates.

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. L.C.W. Dixon and G.P. Szego,Towards Global Optimisation 2 (North-Holland, Amsterdam, 1978).

    Google Scholar 

  2. Y.P. Evtushenko, “Numerical methods for finding global extrema of a non-uniform mesh,”USSR Computational Mathematics and Mathematical Physics 11 (1971).

  3. P. Gill, W. Murray and M. Wright,Practical Optimization (Academic Press, London, 1981).

    Google Scholar 

  4. R. Horst, “A general class of branch-and-bound methods in global optimization,”Journal of Optimization Theory and Applications (1985).

  5. R.H. Mladineo, “An algorithm for finding the global maximum of a multimodal, multivariate function,”Mathematical Programming 34 (1986) 188–200.

    Google Scholar 

  6. S.A. Pijavskii, “An algorithm for finding the absolute extremum of a function,”USSR Computational Mathematics and Mathematical Physics (1972) 57–67.

  7. J. Pinter, “Globally convergent methods forn-dimensional multi-extremal optimization,”Optimisation 17 (1986).

  8. H. Ratschek, “Inclusion functions and global optimization,”Mathematical Programming 33 (1985) 300–317.

    Google Scholar 

  9. B. Shubert, “A sequential method seeking the global maximum of a function,”SIAM Journal of Numerical Analysis 9(3) (1972) 379–388.

    Google Scholar 

  10. A.G. Sukharev, “A stochastic algorithm for extremum search, optimal in one step,”USSR Computational Mathematics and Mathematical Physics (1981) 23–39.

  11. G.R. Wood, “Multidimensional bisection applied to global optimization,”Computers & Mathematics with Applications 21 (1991) 161–172.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mladineo, R.H. Convergence rates of a global optimization algorithm. Mathematical Programming 54, 223–232 (1992). https://doi.org/10.1007/BF01586051

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Navigation