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.
Similar content being viewed by others
References
Hansen, E.: Global Optimization Using Interval Analysis, Marcel Dekker, New York, 1992.
Kearfott, R. B.: Rigorous Global Search: Continuous Problems, Kluwer Academic Publishers, Dordrecht, 1996.
Neumaier, A.: Interval Methods for Systems of Equations, Cambridge University Press, Cambridge, 1990.
Ratschek, H. and Rokne, J.: New Computer Methods for Global Optimization, Ellis Horwood, Halsted Press, Chichester, New York, 1988.
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.
Author information
Authors and Affiliations
Rights 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
Issue Date:
DOI: https://doi.org/10.1023/A:1014754803382