candexch
D-optimal design from candidate set using row exchanges
Description
Examples
Input Arguments
Output Arguments
Algorithms
candexch
selects a
starting design X
at random,
and uses a row-exchange algorithm to iteratively
replace rows of X
by rows of
C
in an attempt to improve
the determinant of X'*X
.
Alternatives
The rowexch
function also generates
D-optimal designs using a
row-exchange algorithm, but it automatically
generates a candidate set that is appropriate for
a specified model.
The daugment
function augments a set of
fixed design points using a coordinate-exchange
algorithm; the start
name-value argument provides the same
functionality using the row exchange
algorithm.
Extended Capabilities
Version History
Introduced before R2006a