Adaptive extremal optimization by detrended fluctuation analysis

22Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Global optimization is one of the key challenges in computational physics as several problems, e.g. protein structure prediction, the low-energy landscape of atomic clusters, detection of community structures in networks, or model-parameter fitting can be formulated as global optimization problems. Extremal optimization (EO) has become in recent years one particular, successful approach to the global optimization problem. As with almost all other global optimization approaches, EO is driven by an internal dynamics that depends crucially on one or more parameters. Recently, the existence of an optimal scheme for this internal parameter of EO was proven, so as to maximize the performance of the algorithm. However, this proof was not constructive, that is, one cannot use it to deduce the optimal parameter itself a priori. In this study we analyze the dynamics of EO for a test problem (spin glasses). Based on the results we propose an online measure of the performance of EO and a way to use this insight to reformulate the EO algorithm in order to construct optimal values of the internal parameter online without any input by the user. This approach will ultimately allow us to make EO parameter free and thus its application in general global optimization problems much more efficient. © 2007 Elsevier Inc. All rights reserved.

Cite

CITATION STYLE

APA

Hamacher, K. (2007). Adaptive extremal optimization by detrended fluctuation analysis. Journal of Computational Physics, 227(2), 1500–1509. https://doi.org/10.1016/j.jcp.2007.09.013

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free