A. C. Atkinson, A. N. Donev, and R. D. Tobias, Optimum experimental designs, with SAS, Oxford Statistical Science Series, vol.34, p.42, 2007.

M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions with formulas, graphs, and mathematical tables, Applied Mathematics Series, vol.55, 1972.

R. B. Ash, Probability and measure theory, vol.32, 2000.

R. A. Bailey, Design of comparative experiments, of Cambridge Series in Statistical and Probabilistic Mathematics, vol.25, p.41, 2008.

A. Barvinok, A course in convexity, vol.65, 2002.

J. Bochnak, M. Coste, and M. F. Roy, Real algebraic geometry, vol.37, 1998.

D. P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods, Athena Scientific, 1996.

G. E. Box, W. G. Hunter, and J. S. Hunter, Statistics for experimenters: An introduction to design, data analysis, and model building, p.41, 1978.

J. V. Burke, D. Henrion, A. S. Lewis, and M. L. Overton, Stabilization via nonsmooth, nonconvex optimization, IEEE Transactions on Automatic Control, vol.51, issue.11, p.16, 2006.
DOI : 10.1109/tac.2006.884944

URL : http://homepages.laas.fr/henrion/Papers/chocolate.pdf

J. V. Burke, A. S. Lewis, and M. L. Overton, Variational analysis of the abscissa mapping for polynomials via the Gauß-Lucas theorem, Journal of Global Optimization, vol.28, pp.259-268, 2004.

J. V. Burke and M. L. Overton, Variational analysis of the abscissa mapping for polynomials, SIAM Journal on Control and Optimization, vol.39, issue.6, p.16, 2001.

G. Carlier, On a theorem of Alexandrov, Journal of Nonlinear and Convex Analysis, vol.5, issue.1, pp.49-58, 2004.

M. Claeys, Mesures d'occupation et relaxations semi-définies pour la commande optimale, 2013.

J. A. Cross, Spectral abscissa optimization using polynomial stability conditions, vol.21, 2010.

P. J. Davis, Interpolation and Approximation, p.37, 1963.

Y. De-castro, F. Gamboa, D. Henrion, R. Hess, and J. B. Lasserre, Approximate optimal designs for multivariate polynomial regression, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01483490

H. Dette and Y. Grigoriev, E-optimal designs for second-order response surface models, The Annals of Statistics, vol.42, issue.4, p.42, 2014.
DOI : 10.1214/14-aos1241

URL : https://doi.org/10.1214/14-aos1241

E. De-klerk, R. Hess, and M. Laurent, Improved convergence rates for Lasserre-type hierarchies of upper bounds for box-constrained polynomial optimization, SIAM Journal on Optimization, vol.27, issue.1, pp.347-367, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01290369

E. De-klerk, J. B. Lasserre, M. Laurent, and Z. Sun, Bound-constrained polynomial optimization using only elementary calculations, vol.73, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01698348

E. De-klerk, M. Laurent, and Z. Sun, Convergence analysis for Lasserre's measurebased hierarchy of upper bounds for polynomial optimization, Mathematical Programming Series A, vol.73, pp.1-30, 2016.

H. Dette and W. J. Studden, Geometry of E-optimality, The Annals of Statistics, vol.21, issue.1, p.42, 1993.
DOI : 10.1214/aos/1176349034

URL : https://doi.org/10.1214/aos/1176349034

H. Dette and W. J. Studden, The theory of canonical moments with applications in statistics, probability, and analysis, volume 338 of Wiley series in probabaility and statistics, vol.45, p.42, 1997.

G. Elfving, Optimum allocation in linear regression theory, The Annals of Mathematical Statistics, vol.23, issue.2, p.41, 1952.
DOI : 10.1214/aoms/1177729442

URL : https://doi.org/10.1214/aoms/1177729442

V. Fedorov, Optimal experimental design, Wiley Interdisciplinary Reviews: Computational Statistics, vol.2, issue.5, p.42, 2010.
DOI : 10.1002/wics.100

R. Fletcher, Practical Methods of Optimization, 1987.

S. Filip, Y. Nakatsukasa, L. N. Trefethen, and B. Beckermann, Rational minimax approximation via adaptive barycentric representations, vol.38, 2017.
DOI : 10.1137/17m1132409

URL : https://hal.archives-ouvertes.fr/hal-01942974

P. E. Gill, W. Murray, and M. H. Wright, Practical Optimization, 1981.

J. Gouveia and T. Netzer, Positive polynomials and projections of spectrahedra, SIAM Journal on Optimization, vol.21, issue.3, pp.960-976, 2011.

J. Gouveia, P. A. Parrilo, and R. R. Thomas, Theta bodies for polynomial ideals, SIAM Journal on Optimization, vol.20, issue.4, pp.2097-2118, 2010.
DOI : 10.1137/090746525

URL : http://arxiv.org/pdf/0809.3480

D. Henrion, On semidefinite representations of plane quartics, p.66, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00320368

R. Hess, D. Henrion, J. B. Lasserre, and T. S. Pham, Semidefinite approximations of the polynomial abscissa, SIAM Journal on Control and Optimization, vol.54, issue.3, p.15, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01181623

D. Henrion and J. B. Lasserre, Inner approximations for polynomial matrix inequalities and robust stability regions, IEEE Transactions on Automatic Control, vol.57, issue.6, pp.1456-1467, 2012.
DOI : 10.1109/tac.2011.2178717

URL : https://hal.archives-ouvertes.fr/hal-00588754

D. Henrion, J. B. Lasserre, and J. Löfberg, GloptiPoly 3: moments, optimization and semidefinite programming, Optimization Methods and Sotware, vol.24, issue.4-5, pp.761-779, 2009.
DOI : 10.1080/10556780802699201

URL : https://hal.archives-ouvertes.fr/hal-00172442

D. Henrion, D. Peaucelle, D. Arzelier, and M. ?ebek, Ellipsoidal approximation of the stability domain of a polynomial, IEEE Transactions on Automatic Control, vol.48, issue.12, pp.2255-2259, 2003.

P. Hungerländer and F. Rendl, A feasible active set method for strictly convex quadratic problems with simple bounds, SIAM Journal on Optimization, vol.25, issue.3, pp.1633-1659, 2015.

W. W. Hager and H. Zhang, A new active set algorithm for box constrained optimization, SIAM Journal on Optimization, vol.17, issue.2, pp.526-557, 2006.
DOI : 10.1137/050635225

L. Imhof and W. J. Studden, E-optimal designs for rational models, The Annals of Statistics, vol.29, issue.3, p.42, 2001.
DOI : 10.1214/aos/1009210689

URL : https://doi.org/10.1214/aos/1009210689

J. Kiefer, General equivalence theory for optimum designs (approximate theory)
DOI : 10.1007/978-1-4615-6660-1_17

, The Annals of Statistics, vol.2, issue.5, pp.849-879, 1974.

M. G. Krein and A. A. Nudelman, The Markov moment problem and extremal problems, Translations of Mathematical Monographs, vol.50, p.42, 1977.

M. Korda, Moment-sum-of-squares hierarchies for set approximation and optimal control, 2016.

S. Karlin and W. J. Studden, Optimal experimental designs, The Annals of Mathematical Statistics, vol.37, issue.4, p.41, 1966.

S. Karlin and W. J. Studden, Tchebycheff systems: With applications in analysis and statistics, Pure and Applied Mathematics, vol.15, p.41, 1966.

T. Kriel and M. Schweighofer, On the exactness of Lasserre relaxations for compact convex basic closed semialgebraic sets, vol.70, 2017.

S. Kuriki and H. P. Wynn, Optimal experimental design that minimizes the width of simultaneous confidence bands, p.42, 2017.

J. B. Lasserre, Global optimization with polynomials and the problem of moments, SIAM Journal on Optimization, vol.11, issue.3, pp.796-817, 2001.

J. B. Lasserre, Convex sets with semidefinite representations, Mathematical Programming, vol.149, pp.457-477, 2009.

J. B. Lasserre, Moments, positive polynomials and their applications, 2010.

J. B. Lasserre, A new look at nonnegativity on closed sets and polynomial optimization, SIAM Journal on Optimization, vol.21, issue.3, pp.864-885, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00512560

J. B. Lasserre, A generalization of Löwner-John's ellipsoid theorem, Mathematical Programming, vol.152, issue.1-2, p.51, 2015.

J. B. Lasserre, An introduction to polynomial and semi-algebraic optimization, 2015.
URL : https://hal.archives-ouvertes.fr/hal-02095856

M. Laurent, A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0-1 programming, Mathematics of Operations Research, vol.28, issue.3, pp.470-496, 2003.

M. Laurent, Sums of squares, moment matrices and polynomial optimization, Emerging applications of algebraic geometry, vol.149, pp.157-270

A. M. Law, Simulation Modeling and Analysis. Mc Graw-Hill, p.86, 2007.

M. Ledoux, Differential operators and spectral distributions of invariant ensembles from the classical orthogonal polynomials. The continuous case, Electronic Journal of Probability, vol.9, issue.7, p.49, 2004.

A. S. Lewis, Convex analysis on the Hermitian matrices, SIAM Journal on Optimization, vol.6, issue.1, pp.164-177, 1996.

J. B. Lasserre and T. Netzer, SOS approximations of nonnegative polynomials via simple high degree perturbations, Mathematische Zeitschrift, vol.256, issue.1, pp.99-112, 2007.

J. Löfberg, YALMIP: A toolbox for modeling and optimization in MATLAB, IEEE CACSD Conference, 2004.

J. B. Lasserre and E. Pauwels, Sorting out typicality with the inverse moment matrix SOS polynomial, Advances in Neural Information Processing Systems, p.49, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01331591

M. Liu, H. Qin, and M. Xie, Discrete discrepancy and its application in experimental design, Contemporary multivariate analysis and design of experiments, vol.2, p.41, 2005.

T. Lau and W. J. Studden, Optimal designs for trigonometric and polynomial regression using canonical moments, The Annals of Statistics, vol.13, issue.1, p.42, 1985.

M. Marshall, Positive Polynomials and Sums of Squares. Mathematical Surveys and Monographs 146, p.73, 2008.

M. M. Aps, , 2015.

P. Maréchal, J. J. Ye, and J. Zhou, K-optimal design via semidefinite programming and entropy optimization, Mathematics of Operations Research, vol.40, issue.2, p.42, 2015.

I. Molchanov and S. Zuyev, Optimisation in space of measures and optimal design, ESAIM: Probability and Statistics, vol.8, p.61, 2004.

Y. Nesterov, Squared functional systems and optimization problems, High Performance Optimization, vol.33, pp.405-440, 2000.

J. Nie, The A-truncated K-moment problem, Foundations of Computational Mathematics, vol.14, issue.6, pp.1243-1276, 2014.

T. Netzer, D. Plaumann, and M. Schweighofer, Exposed faces of semidefinitely representable sets, SIAM Journal on Optimization, vol.20, issue.4, p.66, 2010.

L. , Global optimization algorithms for bound constrained problems, 2010.

P. A. Parrilo, Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization, 2000.

P. A. Parrilo, Semidefinite programming relaxations for semialgebraic problems, Mathematical Programming B, vol.96, pp.293-320, 2003.

A. Prestel and C. N. Delzell, Positive Polynomials-From Hilbert's 17th Problem to Real Algebra, Springer Monographs in Mathematics, p.73, 2001.

M. Park and S. Hong, Rank of Handelman hierarchy for max-cut, Operations Research Letters, vol.39, issue.5, pp.323-328, 2011.

M. Park and S. Hong, Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications, Journal of Global Optimization, vol.56, issue.2, pp.727-736, 2013.

L. Pronzato and W. G. Müller, Design of computer experiments: space filling and beyond, Statistics and Computing, vol.22, issue.3, p.41, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00685876

V. Powers and B. Reznick, Polynomials that are positive on an interval, Transactions of the American Mathemthical Society, vol.352, issue.10, pp.4677-4692, 2000.

F. Pukelsheim, Optimal design of experiments, Classics in Applied Mathematics. Society for Industrial and Applied Mathematics, vol.50, 2006.

M. Putinar, Positive polynomials on compact semi-algebraic sets, Indiana University Mathematics Journal, vol.42, issue.3, pp.969-984, 1993.

L. Pronzato and E. Walter, Minimal volume ellipsoids, International Journal of Adaptive Control and Signal Processing, vol.8, issue.1, p.42, 1994.

T. J. Rivlin, Chebyshev polynomials: From Approximation Theory to Algebra and Number Theory, 1990.

G. Sagnol, Computing optimal designs of multiresponse experiments reduces to second-order cone programming, Journal of Statistical Planning and Inference, vol.141, issue.5, p.42, 2011.

K. Schmüdgen, The K-moment problem for compact semi-algebraic sets, Mathematische Annalen, vol.289, pp.203-206, 1991.

R. Schwabe, Optimum designs for multi-factor models, Lecture Notes in Statistics, vol.113, p.42, 2012.

C. Scheiderer, Semidefinitely representable convex sets, 2016.

G. Sagnol and R. Harman, Computing exact D-optimal designs by mixed integer second-order cone programming, The Annals of Statistics, vol.43, issue.5, p.42, 2015.
DOI : 10.1214/15-aos1339

URL : http://arxiv.org/pdf/1307.4953

N. Z. Shor, Quadratic optimization problems. Soviet journal of computer and systems sciences, vol.25, pp.1-11, 1987.

N. Z. Shor, Nondifferentiable Optimization and Polynomial Problems, 1998.
DOI : 10.1007/978-1-4757-6015-6

R. Sinn, Spectrahedra and a Relaxation of Convex Semialgebraic Sets, p.65, 2010.

J. F. Sturm, Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones, Optimization Methods and Software, 1999.
DOI : 10.1080/10556789908805766

URL : http://www.unimaas.nl/~sturm/papers/guide.ps.gz

L. Vandenberghe, S. Boyd, and S. Wu, Determinant maximization with linear matrix inequality constraints, SIAM Journal on Matrix Analysis and Applications, vol.19, issue.2, p.42, 1998.
DOI : 10.1137/s0895479896303430

URL : http://www.stanford.edu/~boyd/papers/pdf/maxdet_rev.pdf

E. Walter, L. Pronzato, and J. Norton, Identification of Parametric Models from Experimental Data, p.41, 1997.

A. Weisse, G. Wellein, A. Alvermann, and H. Fehske, The kernel polynomial method, Review of Modern Physics, vol.78, pp.275-306, 2006.

H. P. Wynn, The sequential generation of D-optimum experimental designs, The Annals of Mathematical Statistics, vol.41, issue.5, p.42, 1970.

V. A. Zorich, Mathematical analysis II, vol.20, 2004.