2000
DOI: 10.2307/1271431
|View full text |Cite
|
Sign up to set email alerts
|

An Algorithm for the Construction of "D-Optimal" Experimental Designs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
86
0

Year Published

2004
2004
2019
2019

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 149 publications
(86 citation statements)
references
References 6 publications
0
86
0
Order By: Relevance
“…is minimized and the correlation among the X factors is zero (or near zero) (Dykstra, 1971;Mitchell, 1974;Galil & Kiefer, 1980). A balanced matrix, in turn, has the same number of levels in each factor (Addelman, 1972;Adekeye & Kunert, 2005).…”
Section: Two-level Factorial Experimental Designs In the Presence Of mentioning
confidence: 99%
See 1 more Smart Citation
“…is minimized and the correlation among the X factors is zero (or near zero) (Dykstra, 1971;Mitchell, 1974;Galil & Kiefer, 1980). A balanced matrix, in turn, has the same number of levels in each factor (Addelman, 1972;Adekeye & Kunert, 2005).…”
Section: Two-level Factorial Experimental Designs In the Presence Of mentioning
confidence: 99%
“…The first approach (hereinafter called RAN) consists of applying the DETMAX technique (Mitchell, 1974) using Statistica commercial software. The design matrix is built aiming at maximum efficiency, whereas the sequencing of its experiments is randomly done.…”
Section: Study Approachesmentioning
confidence: 99%
“…The one mostly used in the robot calibration literature is DETMAX, developed in [16]. DETMAX starts with a randomly selected initial N-pose set and exchanges a pose at each iteration.…”
Section: Existing Robot Calibration Algorithmsmentioning
confidence: 99%
“…It allows the variance of the observation error to be a function of the design point. Mitchell [16] developed an algorithm called DETMAX that allows the number of design points to increase or decrease for a better search and to escape from local optima. Since then, many improvements have been made with respect to computational time and space [12], [3], [9], [22], [1], [21], [8].…”
Section: Introductionmentioning
confidence: 99%
“…We chose the algorithm proposed by Federov (1972) that is often regarded as the most successful (and most time consuming) of the exchange algorithms. The algorithm is also described in Mitchell (1974).…”
Section: Selecting the Combination Of Policy Attributesmentioning
confidence: 99%