We consider optimization problems for complex systems in which the cost function has a multivalleyed landscape. We introduce a new class of dynamical algorithms which, using a suitable annealing procedure coupled with a balanced greedy-reluctant strategy drive the systems towards the deepest minimum of the cost function. Results are presented for the Sherrington-Kirkpatrick model of spin-glasses. © World Scientific Publishing Company.
Finding minima in complex landscapes: Annealed, greedy and reluctant algorithms / P., Contucci; Giardina', Cristian; Giberti, Claudio; Vernia, Cecilia. - In: MATHEMATICAL MODELS AND METHODS IN APPLIED SCIENCES. - ISSN 0218-2025. - ELETTRONICO. - 15:9(2005), pp. 1349-1369. [10.1142/S0218202505000765]
Finding minima in complex landscapes: Annealed, greedy and reluctant algorithms.
GIARDINA', Cristian;GIBERTI, Claudio;VERNIA, Cecilia
2005
Abstract
We consider optimization problems for complex systems in which the cost function has a multivalleyed landscape. We introduce a new class of dynamical algorithms which, using a suitable annealing procedure coupled with a balanced greedy-reluctant strategy drive the systems towards the deepest minimum of the cost function. Results are presented for the Sherrington-Kirkpatrick model of spin-glasses. © World Scientific Publishing Company.
| File | Dimensione | Formato | |
|---|---|---|---|
|
CGGVFindMinMathMod15_05.pdf
Accesso riservato
Tipologia:
Versione dell'autore revisionata e accettata per la pubblicazione
Dimensione
399.27 kB
Formato
Adobe PDF
|
399.27 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
