## 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

#### Abstract

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.

#### Article information

**Source**

Braz. J. Probab. Stat., Volume 29, Number 1 (2015), 53-70.

**Dates**

First available in Project Euclid: 30 October 2014

**Permanent link to this document**

https://projecteuclid.org/euclid.bjps/1414674775

**Digital Object Identifier**

doi:10.1214/13-BJPS228

**Mathematical Reviews number (MathSciNet)**

MR3299107

**Zentralblatt MATH identifier**

1329.62348

**Keywords**

D-optimal design Fedorov’s exchange algorithm Fedorov’s sequential algorithm General equivalence theorem

#### Citation

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