Finding minima in complex landscapes : annealed, greedy and reluctant algorithms

P. Contucci; C. Giardinà; C. Giberti; C. Vernia

doi:10.1142/S0218202505000765

Finding minima in complex landscapes : annealed, greedy and reluctant algorithms

P. Contucci, C. Giardinà, C. Giberti, C. Vernia

Onderzoeksoutput: Bijdrage aan tijdschrift › Tijdschriftartikel › Academic › peer review

1 Citaat (Scopus)

Samenvatting

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.

Originele taal-2	Engels
Pagina's (van-tot)	1349-1370
Tijdschrift	Mathematical Models & Methods in Applied Sciences
Volume	15
Nummer van het tijdschrift	9
DOI's	https://doi.org/10.1142/S0218202505000765
Status	Gepubliceerd - 2005

Toegang tot document

10.1142/S0218202505000765

Citeer dit

@article{a0bfa7d35b264c8db65199ebaf4c2ddb,

title = "Finding minima in complex landscapes : annealed, greedy and reluctant algorithms",

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.",

author = "P. Contucci and C. Giardin{\`a} and C. Giberti and C. Vernia",

year = "2005",

doi = "10.1142/S0218202505000765",

language = "English",

volume = "15",

pages = "1349--1370",

journal = "Mathematical Models & Methods in Applied Sciences",

issn = "0218-2025",

publisher = "World Scientific",

number = "9",

}

TY - JOUR

T1 - Finding minima in complex landscapes : annealed, greedy and reluctant algorithms

AU - Contucci, P.

AU - Giardinà, C.

AU - Giberti, C.

AU - Vernia, C.

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

U2 - 10.1142/S0218202505000765

DO - 10.1142/S0218202505000765

M3 - Article

SN - 0218-2025

VL - 15

SP - 1349

EP - 1370

JO - Mathematical Models & Methods in Applied Sciences

JF - Mathematical Models & Methods in Applied Sciences

IS - 9

ER -

Finding minima in complex landscapes : annealed, greedy and reluctant algorithms

Samenvatting

Toegang tot document

Vingerafdruk

Citeer dit