Interpolating greedy and reluctant algorithms
From MaRDI portal
Abstract: In a standard NP-complete optimization problem we introduce an interpolating algorithm between the quick decrease along the gradient (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 greedy and reluctant.
Recommendations
Cites work
- Energy-decreasing dynamics in mean-field spin models
- scientific article; zbMATH DE number 5595151 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1102774 (Why is no real title available?)
- ON THE STATISTICAL PROPERTIES OF THE LARGE TIME ZERO TEMPERATURE DYNAMICS OF THE SK MODEL
- Statistical Physics of Spin Glasses and Information Processing
Cited in
(4)
This page was built for publication: Interpolating greedy and reluctant algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717537)