All algorithms should count Oracle Complexities (and deterministic time)

[pokutta]

All algorithms should count and report in the state structure:

1. Number of first-order oracle calls so far \nabla f(x)
2. Number of zeroth-order oracle calls so far f(x)
3. Number of LMO calls so far computer_extreme_points
4. Number of active set accesses (if active set is used - otherwise simply report 0)

so that we can measure run time performance also in these typical measures. Note that many, except for maybe the most basic FW algorithms, might have more or less of 1 - 4 per iteration

We should then also in unit test check the number of oracle calls that should be done for certain tests to make sure that a change to the code did not (unintentionally) affects the algorithms' behavior.

I also would like to derive a notion of deterministic time from these measures -> to be discussed separately.