Add preconditioning to all our minimizers?
As far as I understand, it should be possible to speed up all our minimization algorithms (not ony ConjugateGradient) by using an adequate preconditioner if available.
Unfortunately this is not discussed in the Nocedal&Wright book, unless I have missed something. So I'm looking for implementation hints.