2014
DOI: 10.1016/j.jspi.2014.06.002
|View full text |Cite
|
Sign up to set email alerts
|

Design issues related to allocation of experimental units with known covariates into two treatment groups

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
6
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 11 publications
(6 citation statements)
references
References 12 publications
0
6
0
Order By: Relevance
“…From the optimal design perspective, the aim is to obtain an exact design by optimizing a design objective with the treatment allocation as the design variable given fixed covariates, which often results in an optimization problem with binary decision variables. For two treatment allocation, under the linear model assumption without interaction between covariates and treatments, [16] proposed computationally tractable algorithms to search D-and A-optimal designs. Also, with a particular interest of minimizing the variance of the estimated treatment effect (i.e., a D s optimal design criterion), [5] demonstrated that the problem can be solved efficiently based on a generalization of the MAX-CUT semi-definite programming (SDP) relaxation of [14].…”
Section: Instructionmentioning
confidence: 99%
“…From the optimal design perspective, the aim is to obtain an exact design by optimizing a design objective with the treatment allocation as the design variable given fixed covariates, which often results in an optimization problem with binary decision variables. For two treatment allocation, under the linear model assumption without interaction between covariates and treatments, [16] proposed computationally tractable algorithms to search D-and A-optimal designs. Also, with a particular interest of minimizing the variance of the estimated treatment effect (i.e., a D s optimal design criterion), [5] demonstrated that the problem can be solved efficiently based on a generalization of the MAX-CUT semi-definite programming (SDP) relaxation of [14].…”
Section: Instructionmentioning
confidence: 99%
“…Stepwise procedures, on the other hand, often lead to locally optimal solutions rather than globally optimal solutions. However, there are several optimization techniques that help to find exact (global) optimal solution in the field of optimal design of experiments and clinical trials (Hore et al, 13 Hore et al 14 ). A variable neighborhood search algorithm coupled with a stochastic approach can be used for finding the optimal solution (Hore et al 15 ).…”
Section: Group Lassomentioning
confidence: 99%
“…These three conditions play a very important role in the construction of optimal covariate designs under different complete/ incomplete block design set-ups without any neighbor effects. The monograph ofDas et al (2015) shows in detail Hore et al (2014). proposed a new algorithm for optimal or near optimal allocation where there is large number of experimental units and several covariates.Sinha et al (2014) discussed the formulation of problem of allocation of one controllable covariate in the context of an experiment involving several treatments.…”
mentioning
confidence: 99%