Skip to main content
Log in

A Surprising Approach in Interval Global Optimization; Dedicated to Prof. Dr. Gregory G. Menshikov on the occasion of his 70th anniversary

  • Published:
Reliable Computing

Abstract

The work advances a new class of global optimization methods, called graph subdivision methods, that are based on the simultaneous adaptive subdivision of both the function's domain of definition and the range of values.

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. Hansen, E.: Global Optimization Using Interval Analysis, Marcel Dekker, New York, 1992.

    Google Scholar 

  2. Kearfott, R. B.: Rigorous Global Search: Continuous Problems, Kluwer Academic Publishers, Dordrecht, 1996.

    Google Scholar 

  3. Neumaier, A.: Interval Methods for Systems of Equations, Cambridge University Press, Cambridge, 1990.

    Google Scholar 

  4. Ratschek, H. and Rokne, J.: New Computer Methods for Global Optimization, Ellis Horwood, Halsted Press, Chichester, New York, 1988.

    Google Scholar 

  5. Semenov, A. L.: Solving Optimization Problems with Help of the UniCalc Solver, in: Kearfott, R. B. and Kreinovich, V. (eds), Applications of Interval Computations, Kluwer Academic Publishers, Dordrecht, 1996, pp. 211-225.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shary, S.P. A Surprising Approach in Interval Global Optimization; Dedicated to Prof. Dr. Gregory G. Menshikov on the occasion of his 70th anniversary . Reliable Computing 7, 497–505 (2001). https://doi.org/10.1023/A:1014754803382

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1014754803382

Keywords

Navigation