Relaxing the Assumptions of the Multilevel SingleLinkage Algorithm

Authors:
Marco Locatelli
Affiliations:
University of Trier, Department of Mathematics, D-54286 Trier, Germany E-mail: locatel@uni-trier.de
Venue:
Journal of Global Optimization
Year:
1998

Citing 5
Cited 1

Stochastic global optimization methods. part 1: clustering methods

Mathematical Programming: Series A and B
Stochastic global optimization methods. part 11: multi level methods

Mathematical Programming: Series A and B
Random tunneling by means of acceptance-rejection sampling for global optimization

Journal of Optimization Theory and Applications
A quasi-discrete newton algorithm with a nonmonotone stabilization technique

Journal of Optimization Theory and Applications
Concurrent stochastic methods for global optimization

Mathematical Programming: Series A and B

Selective Search for Global Optimization of Zero or Small Residual Least-Squares Problems: A Numerical Study

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we relax the assumptionsof a well known algorithm for continuous global optimization, MultilevelSingle Linkage (MLSL). It is shown that the goodtheoretical properties of MLSL are shared bya slightly different algorithm, Non-monotonic MLSL (NM MLSL),but under weaker assumptions.The main difference with MLSL is the fact that in NM MLSLsome non-monotonic sequences of sampled points are also consideredin order to decide whether to start or not a local search, whileMLSL only considers monotonic decreasing sequences. The modificationis inspiredby non-monotonic methods for local searches.