Random linkage: A family of acceptance/rejection algorithms for global sation

DOI10.1007/s101070050062zbMath0946.90063OpenAlexW2084562343MaRDI QIDQ1300275

Fabio Schoen, Marco Locatelli

Publication date: 4 June 2000

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070050062

zbMATH Keywords

global optimizationclusteringstochastic algorithmsrandom search

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Operations research and management science (90B99)

Related Items (15)

Supporting adaptive and irregular parallelism for non-linear numerical optimization ⋮ Univariate global optimization with multiextremal non-differentiable constraints without penalty functions ⋮ A trust-region algorithm for global optimization ⋮ On the convergence rate issues of general Markov search for global minimum ⋮ Local optima smoothing for global optimization ⋮ Continuous GRASP with a local active-set method for bound-constrained global optimization ⋮ Nonautonomous stochastic search for global minimum in continuous optimization ⋮ Global convergence of discrete-time inhomogeneous Markov processes from dynamical systems perspective ⋮ Global optimization methods for high-dimensional problems ⋮ Global optimization based on local searches ⋮ Global optimization based on local searches ⋮ Simple linkage: Analysis of a threshold-accepting global optimization method ⋮ Towards ``Ideal multistart. A stochastic approach for locating the minima of a continuous function inside a bounded domain ⋮ Modular Parameter Identification of Biomolecular Networks ⋮ Recent developments and trends in global optimization

This page was built for publication: Random linkage: A family of acceptance/rejection algorithms for global sation