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.
Original language | English |
---|---|
Pages (from-to) | 509-514 |
Number of pages | 6 |
Journal | Optimization Methods and Software |
Volume | 20 |
Issue number | 4-5 |
DOIs | |
Publication status | Published - 2005 |