Recent developments in D-optimal designs

In the paper, some issues concerned with the determining spring balance weighing designs satisfying the criterion of D-optimality under the assumption measurement errors are uncorrelated and they have the same variances are discussed. In addition, highly D-efficient spring balance weighing designs are also considered. Some conditions under which any spring balance weighing design is regular D-optimal or highly D-efficient are proved. What is more, new construction methods of regular D-optimal and highly D-efficient spring balance weighing designs are presented.     

Construction of New Three-Level Response Surface Designs

Response surface methodology is widely used for developing, improving, and optimizing processes in various fields. In this article, we present a method for constructing three-level designs in order to explore and optimize response surfaces combining orthogonal arrays and covering arrays in a particular manner. The produced designs achieve the properties of rotatability, predictive performance and efficiency for the estimation of a second-order model.     

Saturated main-effect designs for factorial experiments

The results of a computer search for saturated designs for 2ⁿ factorial experiments with n runs is reported, (where n = 2 mod 4). A complete search of the design space is avoided by focussing on designs constructed from cyclic generators. A method of searching quickly for the best generators is given. The resulting designs are as good as, and sometimes better than, designs obtained via search algorithms reported in the literature. The addition of a further factor having three levels is also considered. Here, too, a complete search is avoided by restricting attention to the most efficient part of the design space under p-efficiency.     

A method for constructing supersaturated designs and its Es2 optimality

A lower bound for the Es² value of an arbitrary supersaturated design is derived. A general method for constructing supersaturated designs is proposed and shown to produce designs with n runs and m = k(n — 1) factors that achieve the lower bound for Es² and are thus optimal with respect to the Es² criterion. Within the class of designs given by the construction method, further discrimination can be made by minimizing the pairwise correlations and using the generalized D and A criteria proposed by Wu (1993). Efficient designs of 12, 16, 20 and 24 runs are constructed by following this approach.     

Efficient Block Designs for Dependent Observations—A Computer-Aided Search

In this article, the exchange and interchange algorithm of Zergaw (1989 Zergaw , G. ( 1989 ). A sequential method of constructing optimal block designs . Austral. J. Statist. 31 : 333 – 342 .[Crossref] , [Google Scholar]) and Martin and Eccleston (1992 Martin , R. J. , Eccleston , J. A. ( 1992 ). Recursive formulae for constructing block designs with dependent errors . Biometrika 79 : 426 – 430 .[Crossref], [Web of Science ®] , [Google Scholar]) have been modified and used for searching efficient block designs for making all possible pairwise treatment comparisons when observations are dependent. The lower bounds to the A- and D-efficiencies of the designs in a given class of the designs have been obtained for correlated observation structure and the procedure of computing lower bounds to A- and D-efficiencies has been incorporated in the algorithm. The algorithm has been translated into a computer program using Microsoft Visual C++. Using this program, a search for efficient designs for making all possible pairwise treatment comparisons has been made for v ≤ 10, b ≤ 33, k ≤ 10 such that bk ≤ 100 and v > k. The block designs considered are usual block designs (rectangular block designs) and circular block designs. Nearest neighbor (NN), autoregressive of order 1 (AR(1)) correlation structures are studied. The ranges of correlation coefficients for different correlation structures investigated are |ρ|≤0.50 for NN correlation structure in rectangular blocks, |ρ|≤0.45 for NN correlation structure in circular blocks, and |ρ|≤0.95 for AR(1) correlation structure. For these ranges, the matrix of correlation coefficients among observations within a block is positive definite. Robustness aspects of designs that are efficient for a given value of correlation have been investigated against other values of correlation coefficients. Robustness aspects of designs that are efficient for independent observations have also been studied for experimental situations with dependent observations.     

Cyclic designs for a covariate model

A linear model with one treatment at V levels and first order regression on K continuous covariates with values on a K-cube is considered. We restrict our attention to classes of designs d for which the number of observations N to be taken is a multiple of V, i.e. N = V × R with R ≥2, and each treatment level is observed R times. Among these designs, called here equireplicated, there is a subclass characterized by the following: the allocation matrix of each treatment level (for short, allocation matrix) is obtained through cyclic permutation of the columns of the allocation matrix of the first treatment level. We call these designs cyclic. Besides having easy representation, the most efficient cyclic designs are often D-optimal in the class of equireplicated designs. A known upper bound for the determinant of the information matrix M(d) of a design, in the class of equireplicated ones, depends on the congruences of N and V modulo 4. For some combinations of parameter moduli, we give here methods of constructing families of D-optimal cyclic designs. Moreover, for some sets of parameters (N, V,K = V), where the upper bound on ∣M(d)∣ (for that specific combination of moduli) is not attainable, it is also possible to construct highly D-efficient cyclic designs. Finally, for N≤24 and V≤6, computer search was used to determine the most efficient design in the class of cyclic ones. They are presented, together with their respective efficiency in the class of equireplicated designs.     

On some DS-optimal designs in spherical regions

For polynomial regression over spherical regions the d-th order D_s-optimal designs for the λ-th order models are derived for 1 ≤ λ ≤ d ≤ 4. Efficiencies of these designs with respect to the λ-th order D-optimal designs are obtained. The effects of estimating addtional parameters due to an m-th order model (d ≥ m >>λ) on the efficiencies are investigated.     

Orthogonal-array composite design for the third-order models

In many industrial trials, the second-order models may not be enough to fit the non linearity of the underlying model, and the third-order models may be considered. In this article, the orthogonal-array composite design (OACD), combined with two-level OA and four-level OA and denoted by OACD₄, is proposed to estimate the second-order and third-order models. It is shown that OACD₄ has good properties and has higher efficiency than other types of designs for the third-order models, and OACD₄ can perform multiple analysis for cross-validation. The usefulness of OACD₄ is also shown by a case study for polymer synthesis experiment.     

D-optimal designs for beta regression models with single predictor

The problem of construction of D-optimal designs for beta regression models involving one predictor is considered for the mean-precision parameterization suggested by Ferrari and Cribari-Neto [Beta regression for modelling rates and proportions. J Appl Stat. 2004;31:799–815]. Here we use the logit link function for the mean sub-model. These designs are presented and discussed for unrestricted as well as restricted design regions by considering the precision parameter as (1) a known constant and (2) an unknown constant. Efficiency comparison of obtained designs with commonly used equi-weighted, equi-spaced designs is made to recommend designs for practical use. Real-life applications are given to show the usefulness of these designs.