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

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

    Research output: Contribution to journalArticleAcademicpeer-review

    1 Citation (Scopus)

    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.
    Original languageEnglish
    Pages (from-to)1349-1370
    JournalMathematical Models & Methods in Applied Sciences
    Volume15
    Issue number9
    DOIs
    Publication statusPublished - 2005

    Fingerprint Dive into the research topics of 'Finding minima in complex landscapes : annealed, greedy and reluctant algorithms'. Together they form a unique fingerprint.

    Cite this