𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Axiomatic characterization of a global optimization algorithm and investigation of its search strategy

✍ Scribed by Antanas Žilinskas

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
330 KB
Volume
4
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Global optimization properties of parall
Global optimization properties of parallel cooperative search algorithms: A simulation study
✍ Michel Toulouse; Teodor Gabriel Crainic; K Thulasiraman 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 232 KB

Cooperative search is a parallelization strategy where parallelism is obtained by concurrently executing several search programs for the same optimization problem instance. The programs cooperate by exchanging information on previously explored regions of the solution space. When the sharing of info

Global geometry optimization of clusters
Global geometry optimization of clusters using a growth strategy optimized by a genetic algorithm
✍ Bernd Hartke 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 595 KB

A new strategy for global geometry optimization of clusters is presented. Important features are a restriction of search space to favorable nearest-neighbor distance ranges, a suitable cluster growth representation with diminished correlations, and easy transferability of the results to larger clust

New Tabu Search based global optimizatio
New Tabu Search based global optimization methods outline of algorithms and study of efficiency
✍ Svetlana Stepanenko; Bernd Engels 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 381 KB

## Abstract The study presents two new nonlinear global optimization routines; the Gradient Only Tabu Search (GOTS) and the Tabu Search with Powell's Algorithm (TSPA). They are based on the Tabu‐Search strategy, which tries to determine the global minimum of a function by the __steepest descent–mil

Effect of the subdivision strategy on co
Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
✍ Hoang Tuy 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 874 KB

We investigate subdivision strategies that can improve the convergence and efficiency of some branch and bound algorithms of global optimization. In particular, a general class of so called weakly exhaustive simplicial subdivision processes is introduced that subsumes all previously known radial exh