This problem looks easy, but I can't figure out how to start. How does one find the global minimum of a function g(x) where:-
g(x) = SUM{ mod(x - a_n) }
a_n is meant to be a-subscript-n
summation is from n=1 to N
This problem looks easy, but I can't figure out how to start. How does one find the global minimum of a function g(x) where:-
g(x) = SUM{ mod(x - a_n) }
a_n is meant to be a-subscript-n
summation is from n=1 to N