Although the search space is different than that of Och's algorithm, it still relies on one-dimensional line searches to reflect, expand, or contract the simplex.
it suffers the same problems of one-dimensional MERT: feature sets with complex non-linear interactions are difficult to optimize.