Description Usage Arguments Details Value Note Author(s) References See Also Examples
Computes an efficient exact design under general linear constraints via a quadratic approximation of the optimality criterion.
1 2 3 |
Fx |
the |
b1,A1, b2,A2, b3,A3 |
the real vectors and matrices that define the constraints on permissible designs |
w0 |
a non-negative vector of length |
bin |
Should each design point be used at most once? |
crit |
The optimality criterion. Possible values are |
h |
a non-zero vector of length |
M.anchor |
the |
ver.qa |
version of the criterion; possible values are |
conic |
Should the conic reformulation be used? |
t.max |
the time limit for the computation. |
echo |
Print the call of the function? |
At least one of b1
, b2
, b3
must be non-NULL
.
If bi
is non-NULL
and Ai
is NULL
for some i
then Ai
is set to be the vector of ones. If bi
is NULL
for some i
then Ai
is ignored.
A list with the following components:
call |
The call of the function. |
w.best |
The permissible design found, or |
supp |
The indices of the support of |
w.supp |
The weights of |
M.best |
The information matrix of |
Phi.best |
The value of the criterion of optimality of the design |
status |
The status variable of the gurobi optimization procedure; see the gurobi solver documentation for details. |
t.act |
The actual time of the computation. |
The function does not support the classical c-optimality, but it includes its regularized version referred to as C-optimality. The computation is generally stable, but it may fail for instance if the model is numerically singular, there is no exact design satisfying the constraints, no permissible exact design was found within the time limit, the set of feasible exact designs is unbounded and so on; see the status
variable for more details. Note, however, that status = "OPTIMAL"
indicates that the auxiliary integer programming problem was completely solved, which for this procedure does not guarantee that the result is a globally optimal design.
Radoslav Harman, Lenka Filova
Harman R., Filova L. (2014): Computing efficient exact designs of experiments using integer quadratic programming, Computational Statistics & Data Analysis, Volume 71, pp. 1159-1167
Filova L., Harman R. (2018). Ascent with Quadratic Assistance for the Construction of Exact Experimental Designs. arXiv preprint arXiv:1801.09124. (Submitted to Computational Statistics)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 | ## Not run:
# Compute an I-efficient non-replicated exact design of size 51
# for the "special cubic" model with 3 mixture components
# Each factor has 11 levels:
form.sc <- ~x1 + x2 + x3 + I(x1*x2) + I(x1*x3) + I(x2*x3) + I(x1*x2*x3) - 1
Fx <- Fx_simplex(form.sc, 11)
w <- od_AQUA(Fx, b3 = 51, crit = "I", bin = TRUE)$w.best
od_plot(Fx, w, Fx[, 1:3])
# Each factor has 101 levels (memory intensive without the conic trick)
Fx <- Fx_simplex(form.sc, 101)
w <- od_AQUA(Fx, b3 = 51, crit = "I", bin = TRUE, t.max = 10)$w.best
od_plot(Fx, w, Fx[, 1:3])
# Find an A-efficient exact design for the spring balance model
# with 5 items and 10 weighings
Fx <- Fx_cube(~x1 + x2 + x3 + x4 + x5 - 1, lower = rep(0, 5))
w <- od_AQUA(Fx, b3 = 10, crit = "A", t.max = 10)$w.best
od_print(Fx, w)
## End(Not run)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.