An algorithm for optimal designs on a design space

Two variations of a simple monotunic algorithm for computing optimal designs on a finite design space are presented. Various properties are listed. Comparisons witn other algorithms are made.     

D-optimal minimax regression designs on discrete design space

One classical design criterion is to minimize the determinant of the covariance matrix of the regression estimates, and the designs are called D-optimal designs. To reflect the nature that the proposed models are only approximately true, we propose a robust design criterion to study response surface designs. Both the variance and bias are considered in the criterion. In particular, D-optimal minimax designs are investigated and constructed. Examples are given to compare D-optimal minimax designs with classical D-optimal designs.     

Some results on optimal design under a first-order autoregression and on finite williams type ii designs

It was shown, essentially, by Kiefer (1961) that the type II (a) design of Williams (1952) is asymptotically universally optimum for a first-order autoregression with parameter λ >0. We investigate any optimality properties these designs have when finite. We show that small differences in the definitions of the autoregression or of the design can lead to standard results in the theory of optiaml design no longer being applicable. We include some useful results on patterned matrices.     

Simplex based space filling designs

Space filling designs are important for deterministic computer experiments. Even a single experiment can be very time consuming and can have many input parameters. Furthermore the underlying function generating the output is often nonlinear. Thus, the computer experiment has to be designed carefully. There exist many design criteria, which can be numerically optimized. Here, a method is developed, which does not need algorithmic optimization. A mesh of nearly regular simplices is constructed and the vertices of the simplices are used as potential design points. The extraction of a design from these meshes is very fast and easy to implement once the underlying mesh has been constructed. The extracted designs are highly competitive regarding the maximin design criterion and it is easy to extract designs for nonstandard design spaces.     

Extendable Steiner designs from finite geometries

We describe a simple procedure for constructing Steiner 2-designs with the parameters of the designs of points and lines of a finite projective or affine geometry of dimension m⩾3; the codes of many of the designs constructed in this way will contain the code of the relevant finite-geometry design (a Reed-Muller or generalized Reed-Muller code). The designs can be extended to 3-designs provided that planes in the finite-geometry design extend.     

Simple random sample equivalent survey designs reducing undesirable units from a finite population

In this paper, we consider fixed size sampling plans for which the first order inclusion probabilities are identical for all units and the second order inclusion probabilities are constant for every pair-wise unit. The statistical conditions are identified under which these plans are equivalent to the usual simple random sampling plan. These sampling plans are constructed to reduce undesirable units.     

Orientation relationship in finite dimensional space

In the present article, we discuss the regression of a point on the surface of a unit sphere in d dimensions given a point on the surface of a unit sphere in p dimensions, where p may not be equal to d. Point projection is added to the rotation and linear transformation for regression link function. The identifiability of the model is proved. Then, parameter estimation in this set up is discussed. Simulation studies and data analyses are done to illustrate the model.     

A characterization of a universally optimal design within a class of block designs

It is shown that within the class of connected binary designs with arbitrary block sizes and arbitrary replications only a symmetic balanced incomplete block design produces a completely symmetric information matrix for the treatment effects whenever the number of blocks is equal to the number of treatments and the number of experimental units is an integer multiple of the number of treatments. Such a design is known to be universally optimal.     

Optimum covariate designs in split-plot and strip-plot design set-ups

The problem considered is that of finding optimum covariate designs for estimation of covariate parameters in standard split-plot and strip-plot design set-ups with the levels of the whole-plot factor in r randomised blocks. Also an extended version of a mixed orthogonal array has been introduced, which is used to construct such optimum covariate designs. Hadamard matrices, as usual, play the key role for such construction.     

Minimal 2-coverings of a finite affine space based on GF(2)

Let EG(m, 2) denote the m-dimensional finite Euclidean space (or geometry) based on GF(2), the finite field with elements 0 and 1. Let T be a set of points in this space, then T is said to form a q-covering (where q is an integer satisfying 1?q?m) of EG(m, 2) if and only if T has a nonempty intersection with every (m-q)-flat of EG(m, 2). This problem first arose in the statistical context of factorial search designs where it is known to have very important and wide ranging applications. Evidently, it is also useful to study this from the purely combinatorial point of view. In this paper, certain fundamental studies have been made for the case when q=2. Let N denote the size of the set T. Given N, we study the maximal value of m.     

Robust designs for first-order multiple design multivariate models

This paper deals with the methodology of obtaining designs that are robust to nonnormality of the error distribution for tests associated with first-order multiple design multivariate linear models.A sequential procedure is given for the generation of the proposed designs.     

Sequential design approaches for bioequivalence studies with crossover designs

The planning of bioequivalence (BE) studies, as for any clinical trial, requires a priori specification of an effect size for the determination of power and an assumption about the variance. The specified effect size may be overly optimistic, leading to an underpowered study. The assumed variance can be either too small or too large, leading, respectively, to studies that are underpowered or overly large. There has been much work in the clinical trials field on various types of sequential designs that include sample size reestimation after the trial is started, but these have seen only little use in BE studies. The purpose of this work was to validate at least one such method for crossover design BE studies. Specifically, we considered sample size reestimation for a two-stage trial based on the variance estimated from the first stage. We identified two methods based on Pocock's method for group sequential trials that met our requirement for at most negligible increase in type I error rate.     

D-optimal minimax design criterion for two-level fractional factorial designs

A D-optimal minimax design criterion is proposed to construct two-level fractional factorial designs, which can be used to estimate a linear model with main effects and some specified interactions. D-optimal minimax designs are robust against model misspecification and have small biases if the linear model contains more interaction terms. When the D-optimal minimax criterion is compared with the D-optimal design criterion, we find that the D-optimal design criterion is quite robust against model misspecification. Lower and upper bounds derived for the loss functions of optimal designs can be used to estimate the efficiencies of any design and evaluate the effectiveness of a search algorithm. Four algorithms to search for optimal designs for any run size are discussed and compared through several examples. An annealing algorithm and a sequential algorithm are particularly effective to search for optimal designs.     

Model and design correspondence in finite population sampling

A correspondence rule is suggested for the choice of a sampling design when prior knowledge concerning a finite population is available. Designs satisfying the correspondence rule are discussed in the case of random permutations models. A general optimality theorem is given for strategies under such models. Approximate correspondences satisfied by systematic sampling and πps sampling are also indicated.     

Singular factorial designs resulting from missing pairs of design points

In industry, experiments are often conducted sequentially due to equipment limitations dictating that only one or two simultaneous runs may be made. In this situation, early termination of the experiment results in missing points, leading to a loss in efficiency or, worse, to a singular subdesign with nonestimable model parameters. We investigate the specific problem of singularity when two points are lost from a factorial design based on n two-level factors. The method is based on the inner products of the coordinate vectors of the omitted design points and leads to some results on the nonexistence of fractional factorial designs.     

Optimum designs for estimation of regression parameters in a balanced treatment incomplete block design set-up

The use of covariates in block designs is necessary when the experimental errors cannot be controlled using only the qualitative factors. The choice of values of the covariates for a given set-up attaining minimum variance for estimation of the regression parameters has attracted attention in recent times. In this paper, optimum covariate designs (OCD) have been considered for the set-up of the balanced treatment incomplete block (BTIB) designs, which form an important class of test-control designs. It is seen that the OCDs depend much on the methods of construction of the basic BTIB designs. The series of BTIB designs considered in this paper are mainly those as described by Bechhofer and Tamhane (1981) and Das et al. (2005). Different combinatorial arrangements and tools such as Hadamard matrices and different kinds of products of matrices viz Khatri-Rao product and Kronecker product have been conveniently used to construct OCDs with as many covariates as possible.     

Type a incomplete multi-response designs

Srivastava considered the problem of designing and analysis of incomplete multi-response experiments, The main characteristics of the analysis given by her are investigated and a general class of incomplete multiresponse designs (Type A) is obtained on the basis of these investigations.     

On optimality properties of simple block designs in the approximate design theory

Optimality properties of approximate block designs are studied under variations of (1) the class of competing designs, (2) the optimality criterion, (3) the parametric function of interest, and (4) the statistical model. The designs which are optimal turn out to be the product of their treatment and block marginals, and uniform designs when the support is specified in advance. Optimality here means uniform, universal, and simultaneous j_p-optimality. The classical balanced incomplete block designs are embedded into this approach, and shown to be simultaneously j_p-optimal for a maximal system of identifiable parameters. A geometric account of universal optimality is given which applies beyond the context of block designs.     

Repeated measurements designs - a review

Any experiment in which one or more of the experimental units is used more than once is called a repeated measurements experiment. The associated design of a repeated measurements experiment is referred to as a repeated measurements design. This review covers some known results on repeated measurements designs. Emphasis is placed on the impact of optimal design theory. Some construction methods for these designs are presented. Hedayat and Afsarinejad (1975) has an extensive bibliography of earlier literature. A bibliography of these designs published after 1974 is provided at the end of this paper.