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. © 2005 Taylor & Francis Group Ltd.
Interpolating greedy and reluctant algorithms / P., Contucci; Giardina', Cristian; Giberti, Claudio; Unguendoli, Francesco; Vernia, Cecilia. - In: OPTIMIZATION METHODS & SOFTWARE. - ISSN 1055-6788. - ELETTRONICO. - 20:4-5(2005), pp. 509-514. [10.1080/10556780500140177]
Interpolating greedy and reluctant algorithms
GIARDINA', Cristian;GIBERTI, Claudio;UNGUENDOLI, Francesco;VERNIA, Cecilia
2005
Abstract
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. © 2005 Taylor & Francis Group Ltd.
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
