Interpolating Greedy and Reluctant Algorithms

Simple item page
dc.creatorContucci, P.
dc.creatorGiardina', C.
dc.creatorGiberti, C.
dc.creatorUnguendoli, F.
dc.creatorVernia, C.
dc.date2003-09-30
dc.date.accessioned2026-07-07T04:30:35Z
dc.date.available2026-07-07T04:30:35Z
dc.descriptionIn 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.
dc.description9 pages. 3 figures
dc.identifierhttps://arxiv.org/abs/math-ph/0309063
dc.identifierhttp://arxiv.org/abs/math-ph/0309063
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/57516
dc.subjectMathematical Physics
dc.subjectDisordered Systems and Neural Networks
dc.titleInterpolating Greedy and Reluctant Algorithms
dc.typetext

Files

Collections

arXiv