𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Properties of the random search in global optimization

✍ Scribed by R. S. Anderssen; P. Bloomfield

Publisher
Springer
Year
1975
Tongue
English
Weight
803 KB
Volume
16
Category
Article
ISSN
0022-3239

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Adaptive random search in Quasi-Monte Ca
Adaptive random search in Quasi-Monte Carlo methods for global optimization
✍ Guiyuan Lei πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 569 KB

## Quasi-Monte Carlo random search is useful in nondifferentiable optimization. Borrowing ideas of population evolution from genetic algorithms, we introduce an adaptive random search in quasi-Monte Carlo methods (AQMC) for global optimization. Adaptive technique is used such that local search can

TABU search methodology in global optimi
TABU search methodology in global optimization
✍ V.V. KovačeviΔ‡-VujčiΔ‡; M.M. ČangaloviΔ‡; M.D. AΕ‘iΔ‡; L. IvanoviΔ‡; M. DraΕΎiΔ‡ πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 553 KB

This paper investigates the application of TABU search methodology in global optimization. A general multilevel TABU search algorithm is proposed. The algorithm is applied to the problem of finding constrained global minima of a piecewise smooth function of the form β€’ (x) --max{~l(X) .... , ~om(x)}

Tabu search method with random moves for
Tabu search method with random moves for globally optimal design
✍ Nanfang Hu πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 601 KB

Optimum engineering design problems are usually formulated as non-convex optimization problems of continuous variables. Because of the absence of convexity structure, they can have multiple minima, and global optimization becomes difficult. Traditional methods of optimization, such as penalty method