Theory of Global Random Search, Softcover reprint of the original 1st ed. 1991
Mathematics and its Applications Series, Vol. 65

Author:

Coordinator: Pintér János D.

Language: English

52.74 €

In Print (Delivery period: 15 days).

Add to cartAdd to cart
Publication date:
341 p. · 15.5x23.5 cm · Paperback
Zhigljavsky (Leningrad U.) presents, in a systematic and thorough way, the methods and theoretical results relating to the global optimization problem of a multivariate function. Global random optimization methods and statistical inferences concerning the maximum of a function and the endpoints of a
1 Global Optimization: An Overview.- 1. Global Optimization Theory: General Concepts.- 2. Global Optimization Methods.- 2. Global Random Search.- 3. Main Concepts and Approaches of Global Random Search.- 4. Statistical Inference in Global Random Search.- 5. Methods of Generations.- 6. Random Search Algorithms for Solving Specific Problems.- 3. Auxiliary Results.- 7. Statistical Inference for the Bounds of Random Variables.- 8. Several Problems Connected with Global Random Search.- References.