MDS (Torczon, 1989) is a direct search method inspired from the simplex methods proposed by Nelder and Mead among other methods. The algorithm conducts a search at multiple directions from the current vertex to find a better vertex. This search is done by one of the following three steps: the rotation step, expansion step or contraction step.