Minimax robust designs for field experiments

Experimental designs for field experiments are useful in planning agricultural experiments, environmental studies, etc. Optimal designs depend on the spatial correlation structures of field plots. Without knowing the correlation structures exactly in practice, we can study robust designs. Various neighborhoods of covariance matrices are introduced and discussed. Minimax robust design criteria are proposed, and useful results are derived. The generalized least squares estimator is often more efficient than the least squares estimator if the spatial correlation structure belongs to a small neighborhood of a covariance matrix. Examples are given to compare robust designs with optimal designs. The work was partially supported by research grants from the Natural Science and Engineering Research Council of Canada.     

More optimal designs for diallel cross experiments

It is shown that the complement of a universally optimal design derivable from a triangular design is again universally optimal in a class of connected designs. Furthermore, some series of universally optimal designs for diallel cross experiments are provided. These observations strengthen the result on universally optimal designs by Das, Dey and Dean (1998). Received: August 1999     

Robust row-column designs for complete diallel cross experiments

This paper investigates the robustness of variance-balanced row-column designs for complete diallel cross experiments for estimating the comparisons among the general combining ability parameters against the loss of observations. A necessary and sufficient condition of robustness as per connectedness criterion is obtained. The robustness of optimal row-column designs of Gupta and Choi (1998) has been investigated for the loss of any m(≥1) observations in a column and for the loss of any two observations in the design. The study of robustness has also been conducted as per A-efficiency criterion.     

Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments

In this paper, we study the problem of D-optimal experimental design under two linear constraints, which can be interpreted as simultaneous restrictions on the size and on the cost of the experiment. For computing a size- and cost-constrained approximate D-optimal design, we propose a specification of the “barycentric” multiplicative algorithm with sequential removal of redundant design points. We analytically prove convergence results for the proposed algorithm and numerically demonstrate its favorable properties compared to competing methods.     

Follow-up experiments for two-level fractional factorial designs via double semifoldover

The addition of another fraction to an initial experiment is often necessary to resolve ambiguities involving aliasing of factorial effects. One of the most widely used techniques for the selection of a follow-up experiment is foldover. However, semifoldover (i.e., adding half of a foldover fraction) frequently permits estimation of as many effects of interest as provided by a foldover. Thus, as an alternative to foldover, this article investigates the construction and theoretical properties of follow-up experiments obtained via the addition of two $n/2$ -run semifoldover fractions. The strategy (termed double semifolding) provides a means of estimating more effects than can be achieved with a foldover design. Through the use of indicator functions, general properties of double semifoldover designs will be developed. Optimal double semifoldover plans, based on several established design criteria, will be discussed and tabulated for practical use.     

Choice of optimal initial designs in sequential experiments

Combined-optimal designs (Li and Lin, 2003) are obviously the best choices for the initial designs if we partition the experiment into two parts with equal size to obtain some information about the process, especially for the case not considering the blocking factor. In this paper, the definition of combined-optimal design is extended to the case when blocking factor is significant, and this new class of designs is called blocked combined-optimal designs. Some general results are obtained which relate 2^k−p_III initial designs with their complementary designs when , where n=2^k−p. By applying these results, we are able to characterize 2^k−p_III combined-optimal designs or blocked combined-optimal designs in terms of their complementary designs. It is also proved that both 2^k−p_III combined-optimal and blocked combined-optimal designs are not minimum aberration designs when and n−1−k > 2. And some combined-optimal and blocked combined-optimal designs with 16 and 32 runs are constructed for illustration. 2000 Mathematics Subject Classifications: 62K15, 62K05     

$${\phi_p}$$-optimal designs for a linear log contrast model for experiments with mixtures

A mixture experiment is an experiment in which the k ingredients are nonnegative and subject to the simplex restriction on the (k − 1)-dimensional probability simplex S ^k-1. In this work, an essentially complete class of designs under the Kiefer ordering for a linear log contrast model with a mixture experiment is presented. Based on the completeness result, -optimal designs for all p,−∞ ≤ p ≤ 1 including D- and A-optimal are obtained, where the eigenvalues of the design moment matrix are used. By using the approach presented here, we gain insight on how these -optimal designs behave. Mong-Na Lo Huang was supported in part by the National Science Council of Taiwan, ROC under grant NSC 93-2118-M-110-001.     

Bayesian U-type design for nonparametric response surface prediction

This paper deals with Bayesian design over U-type designs of n runs and s factors with q levels for nonparametric response surface prediction. The criterion is developed in terms of the asymptotic approach of Mitchell et al. (Ann Statist 22: 634–651, 1994) for a specific covariance kernel. An optimal design is given in approximate design theory over the all level combinations. A connection with orthogonality and aberration is established. A lower bound for the criterion is provided, and numerical results show that this lower bound is tight.     

Two ge neral classes of search designs for factor screening experiments with factors at three levels

In this paper, we are presenting general classes of factor screening designs for identifying a few important factors from a list of m (≥ 3) factors each at three levels. A design is a subset of 3^m possible runs. The problem of finding designs with small number of runs is considered here. A main effect plan requires at least (2m + 1) runs for estimating the general mean, linear and quadratic effects of m factors. An orthogonal main effect plan requires, in addition, the number of runs as a multiple of 9. For example, when m=5, a main effect plan requires at least 11 runs and an orthogonal main effect plan requires 18 runs. Two general factor screening designs presented here are nonorthogonal designs with (2m− 1) runs. These designs, called search designs permit us to search for and identify at most two important factors out of m factors under the search linear model introduced in Srivastava (1975). For example, when m=5, the two new plans given in this paper have 9 runs, which is a significant improvement over an orthogonal main effect plan with 18 runs in terms of the number of runs and an improvement over a main effect plan with at least 11 runs. We compare these designs, for 4≤m≤ 10, using arithmetic and geometric means of the determinants, traces, and maximum characteristic roots of certain matrices. Two designs D1 and D2 are identical for m=3 and this design is an optimal design in the class of all search designs under the six criteria discussed above. Designs D1 and D2 are also identical for m=4 under some row and column permutations. Consequently, D1 and D2 are equally good for searching and identifying one important factor out of m factors when m=4. The design D1 is marginally better than the design D2 for searching and identifying one important factor out of m factors when m=5, … , 10. The design D1 is marginally better than the D2 for searching and identifying two important factors out of m factors when m=5, 7, 9. The design D2 is somewhat better than the design D1 for m=6, 8. For m=10, D1 is marginally better than D2 w.r.t. the geometric mean and D2 is marginally better than D1 w.r.t. the arithmetic mean of the maximum characteristic roots.     

Optimal designs for Cox regression

Optimal designs under a survival analysis framework have been rarely considered in the literature. In this paper, an optimal design theory is developed for the typical Cox regression problem. Failure time is modeled according to a probability distribution depending on some explanatory variables through a linear model. At the end of the study, some units will not have failed and thus their time records will be censored. In order to deal with this problem from an experimental design point of view it will be necessary to assume a probability distribution for the time an experimental unit enters the study. Then an optimal conditional design will be computed at the beginning of the study for any possible given time. Thus, every time a new unit enters the study, there is an experimental design to be determined. A particular and simple case is used throughout the paper in order to illustrate the procedure.     

Optimal and robust designs for trigonometric regression models

This article presents discussions on the optimal and robust designs for trigonometric regression models under different optimality criteria. First, we investigate the classical Q-optimal designs for estimating the response function in a full trigonometric regression model with a given order. The equivalencies of Q-, A-, and G-optimal designs for trigonometric regression in general are also articulated. Second, we study minimax designs and their implementation in the case of trigonometric approximation under Q-, A-, and D-optimality. Then, We indicate the existence of the symmetric designs that are D-optimal minimax designs for general trigonometric regression models, and prove the existence of the symmetric designs that are Q- or A-optimal minimax designs for two particular trigonometric regression models under certain conditions.     

Estimation and optimal designs for linear Haar-wavelet models

This paper gives an analytical expression for the best linear unbiased estimator (BLUE) of the unknown parameters in the linear Haar-wavelet model. From the analytical expression, we solve for the eigenvalues of the covariance matrix of the BLUE in analytical form. Further, we use these eigenvalues to construct some conventional discrete optimal designs for the model. The equivalences among these optimal designs are demonstrated and some examples are also given.      

Multiple aspect testing for case-control designs

When testing for the equality of two distributions in a case-control design with treatment effects presumed to act possibly on more than one aspect, different tests may be properly considered for testing for different features of a null hypothesis, leading to the multiple aspect testing issue. Two different aspects are therefore of interest: the location-aspect, based on the comparison of location indexes, and the distributional-aspect, based on the comparison of the empirical distribution functions. A simulation study shows that the combined testing procedure exhibits a good robust overall performance, and an application in biomedical research is also presented.     

Optimal block designs for diallel crosses

Dey and Midha (Biometrika 83(2):484–489, 1996) constructed optimal block designs for complete diallel cross experiment using triangular partially balanced incomplete block designs with two associate classes. They listed optimal block designs for the lines in the range from 5 ≤ v ≤ 10. In this paper, we are also proposing additional optimal block designs for complete diallel cross experiment using two associate class partially balanced block designs for some additional values of v. Our method yields designs for proper and non-proper settings for complete diallel cross experiments. The proper and non proper designs are optimal in the sense of Kempthorne (Genetics 41:451–459, 1956) and non-proper designs are universally optimal in the sense of Kiefer (A survey of statistical design and linear models, North Holland, Amsterdam, 1975). The list of practically important designs is also given.     

A recursive method for orthogonal designs

We introduce a class of arrays which can be used with amicable sets of matrices. Using a recursive method we introduce a class of amicable matrices which can be used in the new arrays to generate a large class of full orthogonal designs. The work was completed while the author was on study leave from University of Lethbridge, visiting IPM in Tehran. Hospitality and research grant provided by IPM is greatly appreciated. Supported by an NSERC Discovery grant     

D-optimal weighing designs for six objects

For all integers m≥6, we determine the maximum value of det X ^T X, where X is an m×6 (0, 1)-matrix, and exhibit (D-optimal) matrices X for which the maximum occurs. For D-optimal matrices X, the uniqueness of the Gram matrix X ^T X is discussed. Received: May 2000     

Optimal designs for linear mixture models

Summary In a recent paper S nee and M arquardt [8] considered designs for linear mixture models, where the components are subject to individual lower and/or upper bounds. When the number of components is large their algorithm XVERT yields designs far too extensive for practical purposes.
The purpose of this paper is to describe a numerical procedure resulting in a design of fixed size N , which is approximately D -optimal, and where the components may be subject to linear constraints (f.e. upper or lower bounds). The proposed method is more generally applicable for models linear in the independent variables and the parameters and the convex hull of the experimental region is a polyhedron whose vertices are known.