the actual precision of the result (1 is the perfect precision)
t.iter
the number of iterations of the underlying D-optimum design algorithm
t.act
the actual time of the computation
Arguments
Data
the n times d (where d<n) matrix containing the d-dimensional data-vectors as rows.
alg.AA
the underlying computational method for approximate D-optimal design; possible values are "REX", "MUL" and "VDM".
eff
the minimum required efficiency.
it.max
a limit on the number of iterations of the underlying D-optimum approximate design algorithm.
t.max
a limit on the time of computation.
picture
Should a picture be plotted? (For the picture, the data need to be either two- or three-dimensional.)
echo
Print the call of the function?
track
Display the progress of the computation?
Author
Radoslav Harman, Lenka Filova
Details
The problem of the minimum-volume data-enclosing ellipsoid (MVEE) is computationally equivalent to the problem of D-optimal approximate design for an artificial problem based on the data. This procedure performs the computation and the proper conversion of the D-optimal approximate design to the MVEE parameters (the center and the shape matrix).
References
Harman R, Filova L, Richtarik P (2019). A randomized exchange algorithm for computing optimal approximate designs of experiments. Journal of the American Statistical Association, 1-30.