[MMTK] MMTK 2.0 minimization benchmarks or comparisons?
Andrew P. Mullhaupt
Tue, 14 Dec 1999 22:06:10 -0500
> > While the steepest descent algorithm is
> > reasonably fast in MMTK, the conjugate gradients algorithm seems
> > very slow--I'm guesstimating about 10- to 100-times slower than
That sounds _very_ wrong. Conjugate gradient should be much faster, more
accurate, and more reliable than steepest descent. Steepest descent is one
of those algorithms which should essentially never be used for optimization.