S. Ahipasaoglu, P. Sun, and M. Todd, Linear convergence of a modified Frank???Wolfe algorithm for computing minimum-volume enclosing ellipsoids, Optimization Methods and Software, vol.34, issue.1, pp.5-19, 2008.
DOI : 10.1214/aoms/1177696809

D. Böhning, A vertex-exchange-method in D-optimal design theory, Metrika, vol.34, issue.1, pp.337-347, 1986.
DOI : 10.1007/BF01894766

H. Dette, A. Pepelyshev, and A. Zhigljavsky, Improving updating rules in multiplicative algorithms for computing D-optimal designs, Computational Statistics & Data Analysis, vol.53, issue.2, pp.312-320, 2008.
DOI : 10.1016/j.csda.2008.10.002

V. Fedorov, Theory of Optimal Experiments, 1972.

R. Harman and L. Pronzato, Improvements on removing nonoptimal support points in -optimum design algorithms, Statistics & Probability Letters, vol.77, issue.1, pp.90-94, 2007.
DOI : 10.1016/j.spl.2006.05.014
URL : https://hal.archives-ouvertes.fr/hal-00158649

R. Harman and M. Trnovská, Abstract, Mathematica Slovaca, vol.59, issue.6, pp.693-704, 2009.
DOI : 10.2478/s12175-009-0157-9

L. Khachiyan, Rounding of Polytopes in the Real Number Model of Computation, Mathematics of Operations Research, vol.21, issue.2, pp.307-320, 1996.
DOI : 10.1287/moor.21.2.307

L. Khachiyan and M. Todd, On the complexity of approximating the maximal inscribed ellipsoid for a polytope, Mathematical Programming, vol.2, issue.1-3, pp.137-159, 1993.
DOI : 10.1007/BF01582144

J. Kiefer, General Equivalence Theory for Optimum Designs (Approximate Theory), The Annals of Statistics, vol.2, issue.5, pp.849-879, 1974.
DOI : 10.1214/aos/1176342810

B. Lindsay, The Geometry of Mixture Likelihoods: A General Theory, The Annals of Statistics, vol.11, issue.1, pp.86-94, 1983.
DOI : 10.1214/aos/1176346059

J. Magnus and H. Neudecker, Matrix Differential Calculus with Applications in Statistics and Econometrics., Biometrics, vol.44, issue.4, 1999.
DOI : 10.2307/2531754

A. Mallet, A maximum likelihood estimation method for random coefficient regression models, Biometrika, vol.73, issue.3, pp.645-656, 1986.
DOI : 10.1093/biomet/73.3.645

A. Pázman, Foundations of Optimum Experimental Design. Reidel (Kluwer group), Dordrecht (co-pub, 1986.

L. Pronzato, Removing non-optimal support points in D-optimum design algorithms, Statistics & Probability Letters, vol.63, issue.3, pp.223-228, 2003.
DOI : 10.1016/S0167-7152(03)00081-6
URL : https://hal.archives-ouvertes.fr/hal-00158649

F. Pukelsheim, Optimal Experimental Design, 1993.

R. Schwabe, Optimum Designs for Multi-Factor Models, 1996.
DOI : 10.1007/978-1-4612-4038-9

S. Silvey, D. Titterington, and B. Torsney, An algorithm for optimal designs on a finite design space, Commun. Statist.-Theor. Meth, issue.14, pp.7-1379, 1978.

D. Titterington, Algorithms for computing D-optimal designs on a finite design space, 1976.

M. Todd and E. Yildirim, On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids, Discrete Applied Mathematics, vol.155, issue.13, pp.1731-1744, 2007.
DOI : 10.1016/j.dam.2007.02.013

B. Torsney, A Moment Inequality and Monotonicity of an Algorithm, Proc. Int. Symp. on Semi-infinite Programming and Applications, pp.249-260, 1983.
DOI : 10.1007/978-3-642-46477-5_17

C. Wu, Some Algorithmic Aspects of the Theory of Optimal Designs, The Annals of Statistics, vol.6, issue.6, pp.1286-1301, 1978.
DOI : 10.1214/aos/1176344374

Y. Yu, Strict monotonicity and convergence rate of Titterington???s algorithm for computing D-optimal designs, Computational Statistics & Data Analysis, vol.54, issue.6, pp.1419-1425, 2010.
DOI : 10.1016/j.csda.2010.01.026

Y. Yu, D-optimal designs via a cocktail algorithm, Statistics and Computing, vol.54, issue.4, pp.475-481, 2011.
DOI : 10.1007/s11222-010-9183-2