Searching over a finite set of possible values sounds like a variant
of integer programming. If the finite number is small, then the most
efficient algorithm may be just to compute them all.
However, if it's a number like 13^13, then that's not feasible. If
the objective
Dear R-users,
I am working with some grid-search optimization for 13 values of an
object function.
At glance one may compute the object function for each possible
combination of set of parameters, but in my case would not be feasible:
taking for example 13 possible values for each parameters
