This function implements a rudimentary, bidirectional search algorithm. It works by expanding a grid with given step.size in both directions, starting from an initial feasible point.
gs.algo.bidir(test.results, max.iter, step.size)
The next point to evaluate in the grid search.
Matrix containing the evaluations of the test statistic and critical value.
Maximum number of iterations.
Step size based on which the grid is constructed.