Simple linkage: Analysis of a threshold-accepting global optimization method |
| |
Authors: | M Locatelli F Schoen |
| |
Institution: | (1) Dip. Scienze della Informazione, Università di Milano, via Comelico 39/41, I-20139 Milano, (Italy);(2) Dip. Sistemi e Informatica, Università di Firenze, via di Santa Marta, 3, I-50129 Firenze, (Italy) |
| |
Abstract: | In a recent paper the authors introduced an infinite class of global optimization algorithms based upon random sampling from the feasible region and local searches started from selected sample points, based upon an acceptance/rejection criterion. All of the algorithms of that class possess strong theoretical properties.Here we analyze a member of that family, which, although being significantly simpler to implement and more efficient than the well known Multi-Level Single-Linkage algorithm, enjoys the same theoretical properties. It is shown here that, with very high probability, our method is able to discover from which points Multi-Level Single-Linkage will decide to start local search. |
| |
Keywords: | Randomized algorithms Multi Level Single Linkage Local Searches |
本文献已被 SpringerLink 等数据库收录! |
|