Optimal designs for additive mixture model with heteroscedastic errors

This paper presents a study of D- and A-optimality of direct sum designs for additive mixture models when the errors are heteroscedastic. Sufficient conditions are given so that D- and A-optimal designs for additive mixture models can be constructed from the D- and A-optimal designs for homogeneous models in sub-mixture systems.     

An optimal sign test for one-sample bivariate location model using an alternative bivariate ranked-set sample

The aim of this paper is to find an optimal alternative bivariate ranked-set sample for one-sample location model bivariate sign test. Our numerical and theoretical results indicated that the optimal designs for the bivariate sign test are the alternative designs with quantifying order statistics with labels {((r+1)/2, (r+1)/2)}, when the set size r is odd and {(r/2+1, r/2), (r/2, r/2+1)} when the set size r is even. The asymptotic distribution and Pitman efficiencies of these designs are derived. A simulation study is conducted to investigate the power of the proposed optimal designs. Illustration using real data with the Bootstrap algorithm for P-value estimation is used.     

2<Superscript><Emphasis Type="Italic">m</Emphasis></Superscript>4<Superscript>1</Superscript> designs with minimum aberration or weak minimum aberration

For measuring the goodness of 2 ^m 4¹ designs, Wu and Zhang (1993) proposed the minimum aberration (MA) criterion. MA 2 ^m 4¹ designs have been constructed using the idea of complementary designs when the number of two-level factors, m, exceeds n/2, where n is the total number of runs. In this paper, the structures of MA 2 ^m 4¹ designs are obtained when m>5n/16. Based on these structures, some methods are developed for constructing MA 2 ^m 4¹ designs for 5n/16<m<n/2 as well as for n/2≤m<n. When m≤5n/16, there is no general method for constructing MA 2 ^m 4¹ designs. In this case, we obtain lower bounds for A ₃₀ and A ₃₁, where A ₃₀ and A ₃₁ are the numbers of type 0 and type 1 words with length three respectively. And a method for constructing weak minimum aberration (WMA) 2 ^m 4¹ designs (A ₃₀ and A ₃₁ achieving the lower bounds) is demonstrated. Some MA or WMA 2 ^m 4¹ designs with 32 or 64 runs are tabulated for practical use, which supplement the tables in Wu and Zhang (1993), Zhang and Shao (2001) and Mukerjee and Wu (2001).     

MULTI-FACTOR BALANCED BLOCK DESIGNS WITH COMPLETE ADJUSTED ORTHOGONALITY FOR ALL PAIRS OF TREATMENT FACTORS

A new series of multi-factor balanced block designs is introduced. Each of these designs has the following properties: (i) each of its k– 1 treatment factors is disposed in a cyclic or multi-cyclic balanced incomplete block design with parameters (v,b,r,k,Λ) = (a(k-l) + 1,a²(k-1) +a, ak, k, k) (a > 1); (ii) the incidence of any one of the treatment factors on any other is balanced; and (iii) after adjustment for blocks only, the relationship between any two of the treatment factors is that of adjusted orthogonality. The treatment factors are thus orthogonal to one another in the within-blocks stratum of the analysis of variance. The designs provide a benchmark with which other designs may be compared.     

The analytic construction of D-optimal designs for the two-variable binary logistic regression model without interaction

Candidate locally D-optimal designs for the binary two-variable logistic model with no interaction, which comprise 3 and 4 support points lying in the first quadrant of the two-dimensional Euclidean space, were introduced by Haines et al. (D-optimal designs for logistic regression in two variables. In: Lopez-Fidalgo J, Rodrigez-Diaz JM, Torsney B, editors. MODA8 – advances in model-oriented designs and analysis. Heidelberg: Physica-Verlag; 2007. p. 91–98). The authors proved algebraically the global D-optimality of the 3-point design for the special case in which the intercept parameter is equal to?1.5434. However for other selected values of the intercept parameter, the global D-optimality of the proposed 3- and 4-point designs was only demonstrated numerically. In this paper, we provide analytical proofs of the D-optimality of these 3- and 4-point designs for all negative and zero intercept parameters of the binary two-variable logistic model with no interaction. The results are extended to the construction of D-optimal designs on a rectangular design space and illustrated by means of two examples of which one is a real example taken from the literature.     

Block designs for incomplete factorial treatment structures with two factors

Abstract

In this paper, the problem of obtaining efficient block designs for incomplete factorial treatment structure with two factors excluding one treatment combination for estimation of dual versus single treatment contrasts is considered. The designs have been obtained using the A-optimal completely randomized designs and modified strongest treatment interchange algorithm. A catalog of efficient block designs has been prepared for m₁?=?3, 4 and m₂?=?2, b?≤?10 and k?≤?9 and for m₁?=?3,4 and m₂?=?3, 4, b?≤?10 and k?≤?10.     

Algorithmic construction of optimal block designs for two-colour cDNA microarray experiments using the linear mixed effects model

ABSTRACT

In this study, methods for efficient construction of A-, MV-, D- and E-optimal or near-optimal block designs for two-colour cDNA microarray experiments with array as the block effect are considered. Two algorithms, namely the array exchange and treatment exchange algorithms together with the complete enumeration technique are introduced. For large numbers of arrays or treatments or both, the complete enumeration method is highly computer intensive. The treatment exchange algorithm computes the optimal or near-optimal designs faster than the array exchange algorithm. The two methods however produce optimal or near-optimal designs with the same efficiency under the four optimality criteria.     

Tables of Cyclic Incomplete Block Designs: r=k

Initial blocks and efficiencies are given for cyclic incomplete block designs in the range t= 10(1)60 and r=k= 3(1)10. The designs have been selected by search procedures using optimality criteria which maximize the efficiency factor.     

Robust sequential designs for approximately linear models

We consider the problem of the sequential choice of design points in an approximately linear model. It is assumed that the fitted linear model is only approximately correct, in that the true response function contains a nonrandom, unknown term orthogonal to the fitted response. We also assume that the parameters are estimated by M-estimation. The goal is to choose the next design point in such a way as to minimize the resulting integrated squared bias of the estimated response, to order n^-1. Explicit applications to analysis of variance and regression are given. In a simulation study the sequential designs compare favourably with some fixed-sample-size designs which are optimal for the true response to which the sequential designs must adapt.     

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.     

A bidimensional class of optimality criteria involving φp and characteristic criteria

A new biparametric class of criteria for Optimal Experimental Design generalizing the families of φ_p and Characteristic Criteria is presented. Some properties of the Characteristic Criteria are provided: in particular, differentiability, monotonicity and convexity. A statistical interpretation is also offered. Optimal designs with respect to Characteristic Criteria are obtained for polynomial and compartmental models and an extension of the Michaelis-Menten model. A thorough discussion for the trigonometric model is given. The computed optimal designs are shown to be quite efficient for A-, D- and D_s -optimality. Thus, some of them appear as a natural compromise between different optimality criteria. A simulation in multiple linear regression confirms the quality of Characteristic designs for discovering significant differences between parameters.     

Balanced treatment incomplete block designs through integer programming

An algorithm is presented to construct balanced treatment incomplete block (BTIB) designs using a linear integer programming approach. Construction of BTIB designs using the proposed approach is illustrated with an example. A list of efficient BTIB designs for 2 ? v ? 12, v + 1 ? b ? 50, 2 ? k ? min(10, v), r ? 10, r₀ ? 20 is provided. The proposed algorithm is implemented as part of an R package.     

Algorithmic and analytical construction of efficient designs in small blocks for comparing consecutive pairs of treatments

Optimal block designs in small blocks are explored under the A-, E- and D-criteria when the treatments have a natural ordering and interest lies in comparing consecutive pairs of treatments. We first formulate the problem via approximate theory which leads to a convenient multiplicative algorithm for obtaining A-optimal design measures. This, in turn, yields highly efficient exact designs, under the A-criterion, even when the number of blocks is rather small. Moreover, our approach is seen to allow nesting of such efficient exact designs which is an advantage when the resources for the experiment are available in possibly several stages. Illustrative examples are given and tables of A-optimal design measures are provided. Approximate theory is also seen to yield analytical results on E- and D-optimal design measures.     

An infinite class of PBIB designs

In this paper, an infinite class of partially balanced incomplete block (PBIB) designs of m+1 associate classes is constructed through the use of a series of row-orthogonal matrices known as partially balanced orthogonal designs (PBOD) of m-associate classes. For the purpose, a series of PBOD is obtained through a method described herein. An infinite class of regular GD designs is also reported.     

Optimal designs for calibration of orientations

This paper concerns designed experiments involving observations of orientations following the models of Prentice (1989) and Rivest &Chang (2006). The authors state minimal conditions on the designs for consistent least squares estimation of the matrix parameters in these models. The conditions are expressed in terms of the axes and rotation angles of the design orientations. The authors show that designs satisfying U₁ + … + U_n = 0 are optimal in the sense of minimizing the estimation error average angular distance. The authors give constructions of optimal n‐point designs when n ≥ 4 and they compare the performance of several designs through approximations and simulation.     

Construction of some mixed two- and four-level regular designs with GMC criterion

General minimum lower-order confounding (GMC) criterion is to choose optimal designs, which are based on the aliased effect-number pattern (AENP). The AENP and GMC criterion have been developed to form GMC theory. Zhang et al. (2015 Zhang, T.F., Yang, J.F., Li, Z.M., Zhang, R.C. (2015). Construction of regular 2ⁿ4¹ designs with general minimum lower-order confounding. Commun. Stat. - Theory Methods 46:2724–2735.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]) introduced GMC 2ⁿ4^m criterion for choosing optimal designs and constructed all GMC 2ⁿ4¹ designs with N/4 + 1 ? n + 2 ? 5N/16. In this article, we analyze the properties of 2ⁿ4¹ designs and construct GMC 2ⁿ4¹ designs with 5N/16 + 1 ? n + 2 < N ? 1, where n and N are, respectively, the numbers of two-level factors and runs. Further, GMC 2ⁿ4¹ designs with 16-run, 32-run are tabulated.     

A review of optimal designs in survey sampling

Results in five areas of survey sampling dealing with the choice of the sampling design are reviewed. In Section 2, the results and discussions surrounding the purposive selection methods suggested by linear regression superpopulation models are reviewed. In Section 3, similar models to those in the previous section are considered; however, random sampling designs are considered and attention is focused on the optimal choice of π_j. Then in Section 4, systematic sampling methods obtained under autocorrelated superpopulation models are reviewed. The next section examines minimax sampling designs. The work in the final section is based solely on the randomization. In Section 6 methods of sample selection which yield inclusion probabilities π_j = n/N and π_ij = n(n - 1)/N(N - 1), but for which there are fewer than _NC_n possible samples, are mentioned briefly.     

A NEW UPPER BOUND FOR THE EFFICIENCY FACTOR OF A BLOCK DESIGN

An upper bound for the efficiency factor of a block design, which in many cases is tighter than those reported by other authors, is derived. The bound is based on a lower bound for E(1/X) in terms of E(X) and var(X) for a random variable X on the unit interval. For the special case of resolvable designs, an improved bound is given which also competes with known bounds for resolvable designs in some cases.     

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.