A comparison of solutions to the minimal design problem

Two of the recent algorithms for solving the minimal design problem in an efficient and apparently stable manner are presented in a common setting. It is shown that the resulting algorithm maintains attractive features of both earlier algorithms, including efficiency, ease of use, flexibility, in selecting criteria of closeness, as well as, apparently, numerical stability.