pith. sign in

arxiv: cond-mat/0411428 · v1 · submitted 2004-11-17 · ❄️ cond-mat.mtrl-sci · cond-mat.stat-mech

Continuous extremal optimization for Lennard-Jones Clusters

classification ❄️ cond-mat.mtrl-sci cond-mat.stat-mech
keywords optimizationcontinuousextremalclustersproblemresponsibilitysearchingadjustable
0
0 comments X
read the original abstract

In this paper, we explore a general-purpose heuristic algorithm for finding high-quality solutions to continuous optimization problems. The method, called continuous extremal optimization(CEO), can be considered as an extension of extremal optimization(EO) and is consisted of two components, one is with responsibility for global searching and the other is with responsibility for local searching. With only one adjustable parameter, the CEO's performance proves competitive with more elaborate stochastic optimization procedures. We demonstrate it on a well known continuous optimization problem: the Lennerd-Jones clusters optimization problem.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.