Interpolating greedy and reluctant algorithms

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

    Research output: Contribution to journalArticleAcademicpeer-review

    2 Citations (Scopus)
    3 Downloads (Pure)


    In a standard NP-complete optimization problem, we introduce an interpolating algorithm between the quick decrease along the steepest descent direction (greedy dynamics) and a slow decrease close to the level curves (reluctant dynamics). We find that, for a fixed elapsed computer time, the best performance of the optimization is reached at a special value of the interpolation parameter, considerably improving the results of the pure cases of greedy and reluctant.
    Original languageEnglish
    Pages (from-to)509-514
    Number of pages6
    JournalOptimization Methods and Software
    Issue number4-5
    Publication statusPublished - 2005


    Dive into the research topics of 'Interpolating greedy and reluctant algorithms'. Together they form a unique fingerprint.

    Cite this