Skip to main content
Log in

On Timonov's algorithm for global optimization of univariate Lipschitz functions

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

Timonov proposes an algorithm for global maximization of univariate Lipschitz functions in which successive evaluation points are chosen in order to ensure at each iteration a maximal expected reduction of the “region of indeterminacy”, which contains all globally optimal points. It is shown that such an algorithm does not necessarily converge to a global optimum.

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. Hansen, P., B. Jaumard, and S. H. Lu (to appear), Global Optimization of Univariate Lipschitz Functions: Part I. Survey and Properties, Mathematical Programming.

  2. Hansen, P., B. Jaumard and S. H. Lu (to appear), Global Optimization of Univariate Lipschitz Functions: Part II. New Algorithms and Computational Comparison, Mathematical Programming.

  3. Ivanov, V. V. (1972), On Optimal Algorithms of Minimization in the Class of Functions with the Lipschitz Condition, Information Processing 71, 1324–1327.

    Google Scholar 

  4. Piyavskii, S. A. (1967), An Algorithm for Finding the Absolute Minimum of a Function, Theory of Optimal Solutions 2, Kiev, IK AN USSR (in Russian), 13–24.

    Google Scholar 

  5. Piyavskii, S. A. (1972), An Algorthm for Finding the Absolute Extremum of a Function, U.S.S.R. Comput, Maths. Math. Phys. 12, 57–67, (Zh. V chisl Mat. mat. Fiz. 12 (1972) 888–896).

    Google Scholar 

  6. Schoen, F. (1982), On a Sequential Search Strategy in Global Optimization Problems, Calcolo 19, 321–334.

    Google Scholar 

  7. Shubert, B. O. (1972), A Sequential Method Seeking the Global Maximum of a Function, SIAM Journal on Numerical Analysis 9, 379–388.

    Google Scholar 

  8. Sukharev, A. G. (1972), Best Sequential Search Strategies for Finding an Extremum, U.S.S.R. Comput. Maths. Math. Phys. 12, 39–59 (Zh. Vychisl. Mat. mat. Fiz 12 (1971) 35–50).

    Google Scholar 

  9. Timonov, L. N. (1977), An Algorithm for Search of a Global Extremum, Engineering Cybernetics 15, 38–44.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hansen, P., Jaumard, B. & Lu, SH. On Timonov's algorithm for global optimization of univariate Lipschitz functions. J Glob Optim 1, 37–46 (1991). https://doi.org/10.1007/BF00120664

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Key words

Navigation