✦ LIBER ✦

Convergence qualification of adaptive partition algorithms in global optimization

✍ Scribed by János Pintér

Publisher: Springer-Verlag
Year: 1992
Tongue: English
Weight: 1021 KB
Volume: 56
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01580907

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comparison of partition evaluation measu

Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization

✍ Linet Özdamar; Melek Demirhan 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 117 KB

Convergence rates of a global optimizati

Convergence rates of a global optimization algorithm

✍ Regina Hunter Mladineo 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 460 KB

Optimal random non-adaptive algorithm fo

Optimal random non-adaptive algorithm for global optimization of Brownian motion

✍ Hisham Al-Mharmah; James M. Calvin 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 453 KB

Global convergence of quasi-Newton-type

Global convergence of quasi-Newton-type algorithms for some nonsmooth optimization problems

✍ E. Sachs 📂 Article 📅 1983 🏛 Springer 🌐 English ⚖ 837 KB

Convergence and first hitting time of si

Convergence and first hitting time of simulated annealing algorithms for continuous global optimization

✍ M. Locatelli 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 283 KB

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