Implement Brent minimization method about argmin HOT 4 CLOSED

Since I contributed the root-finding Brent method to this library, I would like to comment on this. Yes, root-finding is different from minimization, but there is a tight relationship between those methods. My understanding was that the library focusse on optimization, not only minimization, and root finders can be applied to many optimization problems. Actually, this is what I use Brent's root finder for. A separation of root finding and minimization problems makes sense in the documentation. I would favor a separation within the library only if it occurs that the interface requirements a distinct enough to rectify a separation. However, that's finally up to the library's owner.

from argmin.

I agree with @xemwebe and I also think that root finding algorithms have a place in this library as long as the methods purpose is clear from the documentation. The most difficult question now is probably how the two methods should be named. Do you have any suggestions?

from argmin.

Do you have any suggestions?

Here is a very limited example of how they are named by others:

I think I would personally favor naming them both brent but under different modules, for example root::brent and min::brent where root (or zero) and min (or opt) would host respectively all root-finding and minimization algorithms, a bit similarly to GSL with their prefixes. I think that this could also prevent the accidental use of a root-finding function instead of a minimization function by users.

from argmin.

Thanks a lot for compiling this table! I'd personally prefer the scipy approach, because I find it confusing when there are two methods with the same name, even if they are in different submodules.
I'm unsure whats the best approach to separate root finding from optimization. I think for now I would prefer to have them both in solvers::brent, but I'm open to other suggestions.

from argmin.