Brazilian Journal of Probability and Statistics
- Braz. J. Probab. Stat.
- Volume 29, Number 1 (2015), 53-70.
Some refinements on Fedorov’s algorithms for constructing D-optimal designs
Well-known and widely used algorithms for constructing D-optimal designs are Fedorov’s sequential algorithm and Fedorov’s exchange algorithm. In this paper, we modify these two algorithms by adding or exchanging two or more points simultaneously at each step. This will significantly reduce the number of steps needed to construct a D-optimal design. We also prove the convergence of the proposed sequential algorithm to a D-optimal design. Optimal designs for rational regression are used as an illustration.
Braz. J. Probab. Stat., Volume 29, Number 1 (2015), 53-70.
First available in Project Euclid: 30 October 2014
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Al Labadi, Luai. Some refinements on Fedorov’s algorithms for constructing D-optimal designs. Braz. J. Probab. Stat. 29 (2015), no. 1, 53--70. doi:10.1214/13-BJPS228. https://projecteuclid.org/euclid.bjps/1414674775