Faster Minimax Design

[jeffrey-hokanson]

For the minimax design algorithm based on clustering [MJ18], we could replace the approximate max-norm center computed using the q-norm, with an exact max-center using CVXPY. To improve performance when there are a large number of points, we could incorporate Blitz [JG15] to estimate a working set and use Ritter's Bounding Sphere algorithm to initialize the feasible point.

[jeffrey-hokanson]

This may no longer be necessary. With the new minimax design algorithm based off of Lloyd's algorithm, we can find reasonable designs relatively quickly.