Interpolating Greedy and Reluctant Algorithms

Details Interpolating Greedy and Reluctant Algorithms Interpolating Greedy and Reluctant Algorithms

2003-09-30

arxiv.org/abs/math-ph/0309063v1

Physics

Mathematical Physics

9 pages. 3 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Interpolating Greedy and Reluctant Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Interpolating Greedy and Reluctant Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interpolating Greedy and Reluctant Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-280301