C++ - designing an accelerated 'gradient descent' algorithm.

I think we need a "rewrite" - part 13.

Lets write a testsuite just for "finding the first local extreme".
There is a difference with subsequent local extremes namely in that in this case we really don't care which local extreme we find: any will do.