C. Aaron, A. Cholaquidis, and R. Fraiman, On the maximal multivariate spacing extension and convexity tests. arXiv preprint, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00702275

A. Atkinson, A. Donev, T. , and R. , Optimum Experimental Designs, with SAS, 2007.

P. Audze and V. Eglais, New approach for planning out of experiments. Problems of Dynamics and Strengths, pp.104-107, 1977.

Y. Auffray, P. Barbillon, M. , and J. , Maximin design on non hypercube domains and kernel interpolation, Statistics and Computing, vol.55, issue.1, pp.703-712, 2012.
DOI : 10.1007/s11222-011-9273-9

M. Basseville, Divergence measures for statistical data processing???An annotated bibliography, Signal Processing, vol.93, issue.4, pp.621-633, 2013.
DOI : 10.1016/j.sigpro.2012.09.003
URL : https://hal.archives-ouvertes.fr/hal-01151803

R. Bates, R. Buck, E. Riccomagno, W. , and H. , Experimental design and observation for large systems, Journal of the Royal Statistical Society. Series B, pp.77-94, 1996.

J. Beardwood, J. Halton, and J. Hammersley, The shortest path through many points, Mathematical Proceedings of the Cambridge Philosophical Society, vol.21, issue.04, pp.299-327, 1959.
DOI : 10.2307/2031707

A. Berlinet and C. Thomas-agnan, Reproducing Kernel Hilbert Spaces in Probability and Statistics, 2004.
DOI : 10.1007/978-1-4419-9096-9

D. Bertsimas and J. Tsitsiklis, Simulated Annealing, Statistical Science, vol.8, issue.1, pp.10-15, 1993.
DOI : 10.1214/ss/1177011077

S. Biedermann and H. Dette, Minimax Optimal Designs for Nonparametric Regression ??? A Further Optimality Property of the Uniform Distribution, mODa'6 ? Advances in Model?Oriented Design and Analysis, Proceedings of the 76th Int. Workshop, Puchberg/Schneeberg (Austria), pp.13-20, 2001.
DOI : 10.1007/978-3-642-57576-1_2

A. Blum, J. Hopcroft, and R. Kannan, Foundations of Data Science, 2016.

J. Boissonnat and M. Yvinec, Algorithmic Geometry, 1998.
DOI : 10.1017/CBO9781139172998

J. Bonnans, J. Gilbert, C. Lemaréchal, and C. Sagastizábal, Numerical Optimization. Theoretical and Practical Aspects, 2006.

N. Botkin and V. Turova-botkina, An algorithm for finding the Chebyshev center of a convex polyhedron, Applied Mathematics & Optimization, vol.29, issue.2, pp.211-222, 1994.
DOI : 10.1007/BF01204183

P. Cignoni, C. Montani, and R. Scopigno, DeWall: A fast divide and conquer Delaunay triangulation algorithm in Ed, Computer-Aided Design, vol.30, issue.5, pp.333-341, 1998.
DOI : 10.1016/S0010-4485(97)00082-1

J. Conway and N. Sloane, Sphere Packings, Lattices and Groups, 1999.
DOI : 10.1007/978-1-4757-2016-7

J. Cortés and F. Bullo, Coordination and Geometric Optimization via Distributed Dynamical Systems, SIAM Journal on Control and Optimization, vol.44, issue.5, pp.1543-1574, 2005.
DOI : 10.1137/S0363012903428652

J. Cortés and F. Bullo, Nonsmooth Coordination and Geometric Optimization via Distributed Dynamical Systems, SIAM Review, vol.51, issue.1, pp.163-189, 2009.
DOI : 10.1137/080737551

H. Croft, K. Falconer, and R. Guy, Unsolved Problems in Geometry, 1991.
DOI : 10.1007/978-1-4612-0963-8

V. Dem-'yanov and V. Malozemov, Introduction to Minimax, 1974.

Q. Du, V. Faber, and M. Gunzburger, Centroidal Voronoi Tessellations: Applications and Algorithms, SIAM Review, vol.41, issue.4, pp.637-676, 1999.
DOI : 10.1137/S0036144599352836
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.407.146

N. Durrande, D. Ginsbourger, R. , and O. , Additive Covariance kernels for high-dimensional Gaussian Process modeling, Annales de la facult?? des sciences de Toulouse Math??matiques, vol.21, issue.3, pp.481-499, 2012.
DOI : 10.5802/afst.1342
URL : https://hal.archives-ouvertes.fr/hal-00644934

K. Fang, R. Li, and A. Sudjianto, Design and Modeling for Computer Experiments, 2006.
DOI : 10.1201/9781420034899

K. Fang, X. Lu, and P. Winker, Lower bounds for centered and wrap-around L2-discrepancies and construction of uniform designs by threshold accepting, Journal of Complexity, vol.19, issue.5, pp.692-711, 2003.
DOI : 10.1016/S0885-064X(03)00067-0

K. Fang and C. Ma, Wrap-Around L2-Discrepancy of Random Sampling, Latin Hypercube and Uniform Designs, Journal of Complexity, vol.17, issue.4, pp.608-624, 2001.
DOI : 10.1006/jcom.2001.0589
URL : http://doi.org/10.1006/jcom.2001.0589

K. Fang, Y. Tang, and J. And-yin, Lower bounds for wrap-around <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math>-discrepancy and constructions of symmetrical uniform designs, Journal of Complexity, vol.21, issue.5, pp.757-771, 2005.
DOI : 10.1016/j.jco.2005.01.003

V. Fedorov, Theory of Optimal Experiments, 1972.

V. Fedorov, Design of spatial experiments: model fitting and prediction, Handbook of Statistics, pp.515-553, 1996.
DOI : 10.2172/231193
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.3661

V. Fedorov and S. Leonov, Optimal Design for Nonlinear Response Models, 2014.

B. Flury, Estimation of Principal Points, Applied Statistics, vol.42, issue.1, pp.139-151, 1993.
DOI : 10.2307/2347416

J. Franco, O. Vasseur, B. Corre, and M. Sergent, Minimum Spanning Tree: A new approach to assess the quality of the design of computer experiments, Chemometrics and Intelligent Laboratory Systems, vol.97, issue.2, pp.164-169, 2009.
DOI : 10.1016/j.chemolab.2009.03.011
URL : https://hal.archives-ouvertes.fr/hal-00409737

B. Gauthier and L. Pronzato, Spectral Approximation of the IMSE Criterion for Optimal Designs in Kernel-Based Interpolation Models, SIAM/ASA Journal on Uncertainty Quantification, vol.2, issue.1, pp.805-825, 2014.
DOI : 10.1137/130928534
URL : https://hal.archives-ouvertes.fr/hal-00913466

B. Gauthier and L. Pronzato, Convex relaxation for IMSE optimal design in random-field models, Computational Statistics & Data Analysis, p.1246483, 2016.
DOI : 10.1016/j.csda.2016.10.018
URL : https://hal.archives-ouvertes.fr/hal-01246483

D. Ginsbourger, O. Roustant, D. Schuhmacher, N. Durrande, and N. Lenz, On ANOVA Decompositions of Kernels and Gaussian Random Field Paths, 2014.
DOI : 10.1007/978-3-319-33507-0_15
URL : https://hal.archives-ouvertes.fr/emse-01339368

T. Gonzalez, Clustering to minimize the maximum intercluster distance, Theoretical Computer Science, vol.38, pp.293-306, 1985.
DOI : 10.1016/0304-3975(85)90224-5
URL : http://doi.org/10.1016/0304-3975(85)90224-5

R. Graham and B. Lubachevsky, Repeated patterns of dense packings of equal disks in a square, The Electronic Journal of Combinatorics, vol.3, issue.1, p.16, 1996.

R. Graham, B. Lubachevsky, K. Nurmela, and P. Östergård, Dense packings of congruent circles in a circle, Discrete Mathematics, vol.181, issue.1-3, pp.139-154, 1998.
DOI : 10.1016/S0012-365X(97)00050-2

A. Guyader, N. Hengartner, and E. Matzner-løber, Simulation and Estimation of Extreme Quantiles and Extreme Probabilities, Applied Mathematics & Optimization, vol.22, issue.4, pp.171-196, 2011.
DOI : 10.1007/s00245-011-9135-z
URL : https://hal.archives-ouvertes.fr/hal-00911891

D. Hardin and E. Saff, Discretizing manifolds via minimum energy points, Notices of the AMS, vol.51, issue.10, pp.1186-1194, 2004.

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

F. Hickernell, A generalized discrepancy and quadrature error bound, Mathematics of Computation of the American Mathematical Society, vol.67, issue.221, pp.299-322, 1998.
DOI : 10.1090/S0025-5718-98-00894-1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.2225

F. Hickernell, Lattice Rules: How Well Do They Measure Up?, Random and Quasi-Random Point Sets, pp.109-166, 1998.
DOI : 10.1007/978-1-4612-1702-2_3

S. Janson, Random coverings in several dimensions, Acta Mathematica, vol.156, issue.0, pp.83-118, 1986.
DOI : 10.1007/BF02399201

S. Janson, Maximal spacings in several dimensions. The Annals of Probability, pp.274-280, 1987.
DOI : 10.1214/aop/1176992269
URL : http://projecteuclid.org/download/pdf_1/euclid.aop/1176992269

M. Johnson, L. Moore, Y. , and D. , Minimax and maximin distance designs, Journal of Statistical Planning and Inference, vol.26, issue.2, pp.131-148, 1990.
DOI : 10.1016/0378-3758(90)90122-B

V. Joseph, E. Gul, and S. Ba, Maximum projection designs for computer experiments, Biometrika, vol.102, issue.2, pp.371-380, 2015.
DOI : 10.1093/biomet/asv002

A. Jourdan and J. Franco, A new criterion based on Kullback-Leibler information for space filling designs, p.375820, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00375820

A. Jourdan and J. Franco, Plans d'expériences numériques d'information de Kullback-Leibler minimale, Journal de la Société Française de Statistique, vol.150, issue.2, pp.52-64, 2009.

A. Jourdan and J. Franco, Optimal Latin hypercube designs for the Kullback?Leibler criterion. AStA Advances in Statistical Analysis, pp.341-351, 2010.
DOI : 10.1007/s10182-010-0145-y

R. Kennard and L. Stone, Computer Aided Design of Experiments, Technometrics, vol.11, issue.1, pp.137-148, 1969.
DOI : 10.1080/00401706.1969.10490666

H. Kesten, Accelerated Stochastic Approximation, The Annals of Mathematical Statistics, vol.29, issue.1, pp.41-59, 1958.
DOI : 10.1214/aoms/1177706705
URL : http://projecteuclid.org/download/pdf_1/euclid.aoms/1177706705

V. Klee, On the complexity ofd- dimensional Voronoi diagrams, Archiv der Mathematik, vol.8, issue.1, pp.75-80, 1980.
DOI : 10.1007/BF01224932
URL : http://www.dtic.mil/get-tr-doc/pdf?AD=ADA070098

N. Korobov, Properties and calculation of optimal coefficients, Doklady Akademii Nauk SSSR, vol.132, issue.5, pp.1009-1012, 1960.

L. Kozachenko and N. Leonenko, On statistical estimation of entropy of random vector, Problems Infor. Transmiss, vol.23, issue.23 2, pp.95-101, 1987.

J. Lagarias, The Kepler Conjecture: The Hales-Ferguson Proof, 2011.
DOI : 10.1007/978-1-4614-1129-1

N. Landkof, Foundations of Modern Potential Theory, 1972.
DOI : 10.1007/978-3-642-65183-0

R. Lekivetz and B. Jones, Fast flexible space-filling designs for nonrectangular regions Quality and Reliability Soumis au Journal de la Société Française de Statistique File: LP_jsfds-2016-REV1.tex, compiled with jsfds, version, Engineering International, vol.12, issue.5, pp.31829-837, 2009.
DOI : 10.1002/qre.1640

N. Leonenko, L. Pronzato, and V. Savani, A class of R??nyi information estimators for multidimensional densities, The Annals of Statistics, vol.36, issue.5, pp.2153-21823837, 2008.
DOI : 10.1214/07-AOS539

S. Lloyd, Least squares quantization in PCM, IEEE Transactions on Information Theory, vol.28, issue.2, pp.129-137, 1982.
DOI : 10.1109/TIT.1982.1056489
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.131.1338

B. Lubachevsky, How to simulate billiards and similar systems, Journal of Computational Physics, vol.94, issue.2, pp.255-283, 1991.
DOI : 10.1016/0021-9991(91)90222-7
URL : http://arxiv.org/abs/cond-mat/0503627

B. Lubachevsky and F. Stillinger, Geometric properties of random disk packings, Journal of Statistical Physics, vol.58, issue.1, pp.5-6561, 1990.
DOI : 10.1007/BF01025983

J. Macqueen, Some methods for classification and analysis of multivariate observations, Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, pp.281-297, 1967.

C. Maranas, C. Floudas, P. , and P. , New results in the packing of equal circles in a square, Discrete Mathematics, vol.142, issue.1-3, pp.287-293, 1995.
DOI : 10.1016/0012-365X(93)E0230-2

E. Marengo and R. Todeschini, A new algorithm for optimal, distance-based experimental design, Chemometrics and Intelligent Laboratory Systems, vol.16, issue.1, pp.37-44, 1992.
DOI : 10.1016/0169-7439(92)80076-G

M. Markót and T. Csendes, A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems, SIAM Journal on Optimization, vol.16, issue.1, pp.193-219, 2005.
DOI : 10.1137/S1052623403425617

R. Mitchell, Error estimates arising from certain pseudorandom sequences in a quasirandom search method, Mathematics of Computation, vol.55, issue.191, pp.289-297, 0191.
DOI : 10.1090/S0025-5718-1990-1023765-9

W. Müller, Coffee-House Designs, pp.241-248, 2000.
DOI : 10.1007/978-1-4757-3419-5_21

W. Müller, Collecting Spatial Data, 2007.

H. Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods, 1992.
DOI : 10.1137/1.9781611970081

K. Nurmela and P. Östergård, Packing up to 50 Equal Circles in a Square, Discrete & Computational Geometry, vol.18, issue.1, pp.111-120, 1997.
DOI : 10.1007/PL00009306

K. Nurmela and P. Östergård, More Optimal Packings of Equal Circles in a Square, Discrete & Computational Geometry, vol.22, issue.3, pp.439-457, 1999.
DOI : 10.1007/PL00009472

D. Nuyens, Fast construction of good lattice rules, 2007.

A. Okabe, B. Books, K. Sugihama, and S. Chiu, Spatial Tessellations. Concepts and Applications of Voronoi Diagrams, 1992.
DOI : 10.1002/9781118786352.wbieg0601

N. Oler, A finite packing problem, Bulletin canadien de math??matiques, vol.4, issue.0, pp.153-155, 1961.
DOI : 10.4153/CMB-1961-018-7

M. Penrose and J. Yukich, Weak laws of large numbers in geometric probability, The Annals of Applied Probability, vol.13, issue.1, pp.277-303, 2003.
DOI : 10.1214/aoap/1042765669

M. Penrose and J. Yukich, Laws of Large Numbers and Nearest Neighbor Distances, Advances in Directional and Linear Statistics. A Festschrift for Sreenivasa Rao Jammalamadaka, pp.189-199, 2011.
DOI : 10.1007/978-3-7908-2628-9_13
URL : http://arxiv.org/abs/0911.0331

P. Persson and G. Strang, A Simple Mesh Generator in MATLAB, SIAM Review, vol.46, issue.2, pp.329-345, 2004.
DOI : 10.1137/S0036144503429121
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.84.7905

J. Pilz, Bayesian Estimation and Experimental Design in Linear Regression Models, 1983.

L. Pronzato and W. Müller, Design of computer experiments: space filling and beyond, Statistics and Computing, vol.44, issue.1, pp.681-701, 2012.
DOI : 10.1007/s11222-011-9242-3
URL : https://hal.archives-ouvertes.fr/hal-00685876

L. Pronzato and A. Pázman, Design of Experiments in Nonlinear Models Asymptotic Normality, Optimality Criteria and Small-Sample Properties, LNS, vol.212, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00879984

L. Pronzato, H. Wynn, and A. Zhigljavsky, Extended generalised variances, with applications. Bernoulli (to appear). arXiv preprint arXiv:1411, p.1308092, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01308092

L. Pronzato, H. Wynn, and A. Zhigljavsky, Extremal measures maximizing functionals based on simplicial volumes, Statistical Papers, vol.105, issue.491, p.1308116, 2016.
DOI : 10.1007/s00362-016-0767-6
URL : https://hal.archives-ouvertes.fr/hal-01308116

F. Pukelsheim, Optimal Experimental Design, 1993.

C. Rasmussen and C. Williams, Gaussian Processes in Machine Learning, 2006.
DOI : 10.1162/089976602317250933
URL : http://hdl.handle.net/11858/00-001M-0000-0013-F365-A

C. Redmond and J. Yukich, Limit Theorems and Rates of Convergence for Euclidean Functionals, The Annals of Applied Probability, vol.4, issue.4, pp.1057-1073, 1994.
DOI : 10.1214/aoap/1177004902

C. Redmond and J. Yukich, Asymptotics for Euclidian functionals with power-weighted edges, Stochastic Processes and their Applications, pp.289-304, 1996.
DOI : 10.1016/0304-4149(95)00075-5
URL : http://doi.org/10.1016/0304-4149(95)00075-5

E. Riccomagno, R. Schwabe, W. , and H. , Lattice-based D -optimum design for Fourier regression, The Annals of Statistics, vol.25, issue.6, pp.2313-2327, 1997.
DOI : 10.1214/aos/1030741074
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.5337

G. Roberts and J. Rosenthal, Harris recurrence of Metropolis-within-Gibbs and trans-dimensional Markov chains, The Annals of Applied Probability, vol.16, issue.4, pp.2123-2139, 2006.
DOI : 10.1214/105051606000000510
URL : http://arxiv.org/abs/math/0702412

J. Royle and D. Nychka, An algorithm for the construction of spatial coverage designs with implementation in SPLUS, Computers & Geosciences, vol.24, issue.5, pp.479-488, 1998.
DOI : 10.1016/S0098-3004(98)00020-X

J. Sacks, W. Welch, T. Mitchell, W. , and H. , Design and Analysis of Computer Experiments, Statistical Science, vol.4, issue.4, pp.409-435, 1989.
DOI : 10.1214/ss/1177012413

E. Saff, Logarithmic potential theory with applications to approximation theory, pp.165-200, 2010.

T. Santner, B. Williams, and W. Notz, The Design and Analysis of Computer Experiments, 2003.
DOI : 10.1007/978-1-4757-3799-8

R. Schaback, Error estimates and condition numbers for radial basis function interpolation, Advances in Computational Mathematics, vol.4, issue.3, pp.251-264, 1995.
DOI : 10.1007/BF02432002
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.8132

M. Shewry and H. Wynn, Maximum entropy sampling, Journal of Applied Statistics, vol.14, issue.2, pp.165-170, 1987.
DOI : 10.2307/2987990

S. Silvey, Optimal Design, 1980.
DOI : 10.1007/978-94-009-5912-5

Y. Sinai and N. Chernov, Ergodic properties of certain systems of two-dimensional discs and three-dimensional balls, Russian Mathematical Surveys, vol.42, issue.3, pp.181-207, 1987.
DOI : 10.1070/RM1987v042n03ABEH001421

I. Sloan and A. Reztsov, Component-by-component construction of good lattice rules, Mathematics of Computation, vol.71, issue.237, pp.71263-273, 2002.
DOI : 10.1090/S0025-5718-01-01342-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.403

I. Sloan and L. Walsh, A Computer Search of Rank-2 Lattice Rules for Multidimensional Quadrature, Mathematics of Computation, vol.54, issue.189, pp.281-302, 1990.
DOI : 10.2307/2008695

G. Spöck and J. Pilz, Spatial sampling design and covariance-robust minimax prediction based on convex design ideas, Stochastic Environmental Research and Risk Assessment, vol.11, issue.5, pp.463-482, 2010.
DOI : 10.1007/s00477-009-0334-y

J. Steele, Subadditive Euclidean functionals and nonlinear growth in geometric probability. The Annals of Probability, pp.365-376, 1981.
DOI : 10.1214/aop/1176994411

M. Stein, Interpolation of Spatial Data. Some Theory for Kriging, 1999.

A. Sukharev, Minimax Models in the Theory of Numerical Methods, 1992.
DOI : 10.1007/978-94-011-2759-2

L. Tierney, A note on Metropolis-Hastings kernels for general state spaces, The Annals of Applied Probability, vol.8, issue.1, pp.1-9, 1998.
DOI : 10.1214/aoap/1027961031

F. Vallentin, Sphere coverings, lattices and tilings, 2003.

E. Vazquez and J. Bect, Sequential search based on kriging: convergence analysis of some algorithms, Proc. 58th World Statistics Congress of the ISI, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00643159

M. Viazovska, The sphere packing problem in dimension 8, Annals of Mathematics, vol.185, issue.3, 2016.
DOI : 10.4007/annals.2017.185.3.7
URL : http://arxiv.org/abs/1603.04246

A. Wade, Explicit laws of large numbers for random nearest-neighbour-type graphs, Advances in Applied Probability, vol.11, issue.02, pp.326-342, 2007.
DOI : 10.1142/S0218195905001622

F. Wahl, C. Mercadier, and C. Helbert, Measuring the quality of maximin space-filling designs, p.955294, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00955294

E. Walter and H. Piet-lahanier, Exact recursive polyhedral description of the feasible parameter set for bounded-error models, IEEE Transactions on Automatic Control, vol.34, issue.8, pp.911-915, 1989.
DOI : 10.1109/9.29443

W. Jr and J. , Hierarchical grouping to optimize an objective function, Journal of the American Statistical Association, vol.58, issue.301, pp.236-244, 1963.

S. Xu, R. Freund, and J. Sun, Solution methodologies for the smallest enclosing circle problem, Computational Optimization and Applications, vol.25, pp.1-3283, 2003.

E. Yildirim, Two Algorithms for the Minimum Enclosing Ball Problem, SIAM Journal on Optimization, vol.19, issue.3, pp.1368-1391, 2008.
DOI : 10.1137/070690419
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.7625

J. Yukich, Probability Theory of Classical Euclidean Optimization Problems, 1998.
DOI : 10.1007/BFb0093472

A. Zhigljavsky, H. Dette, and A. Pepelyshev, A New Approach to Optimal Design for Linear Models With Correlated Observations, Journal of the American Statistical Association, vol.105, issue.491, pp.1093-1103, 2010.
DOI : 10.1198/jasa.2010.tm09467

A. Zhigljavsky and E. Hamilton, Stopping rules in k-adaptive global random search algorithms, Journal of Global Optimization, vol.1, issue.1, pp.87-97, 2010.
DOI : 10.1007/s10898-010-9528-6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1031.6189

A. Zhigljavsky and A. ?ilinskas, Stochastic Global Optimization, 2007.
DOI : 10.1007/978-3-642-04898-2_570