Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-14T11:25:51.928Z Has data issue: false hasContentIssue false
  • English
  • Français

Optimisation in space of measures and optimal design

Published online by Cambridge University Press:  15 September 2004

Ilya Molchanov and
Sergei Zuyev
Ilya Molchanov
Affiliation:
Department of Mathematical Statistics and Actuarial Sciences, University of Berne, 3012 Berne, Switzerland; ilya@stat.unibe.ch.
Sergei Zuyev
Affiliation:
Department of Statistics and Modelling Science, University of Strathclyde, Glasgow G1 1XH, UK; sergei@stams.strath.ac.uk.
Get access

Abstract

The paper develops an approach to optimal design problems based on application of abstract optimisation principles in the space of measures. Various design criteria and constraints, such as bounded density, fixed barycentre, fixed variance, etc. are treated in a unified manner providing a universal variant of the Kiefer-Wolfowitz theorem and giving a full spectrum of optimality criteria for particular cases. Incorporating the optimal design problems into conventional optimisation framework makes it possible to use the whole arsenal of descent algorithms from the general optimisation literature for finding optimal designs. The corresponding steepest descent involves adding a signed measure at every step and converges faster than the conventional sequential algorithms used to construct optimal designs. We study a new class of design problems when the observation points are distributed according to a Poisson point process arising in the situation when the total control on the placement of measurements is impossible.

Keywords

Optimal experimental designgeneralized equivalence theoremconstrained optimal designPoisson designoptimization on measuresgradient methods.

Information

Type
Research Article
Information
ESAIM: Probability and Statistics , Volume 8 , August 2004, pp. 12 - 24
Copyright
© EDP Sciences, SMAI, 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

A.C. Atkinson and A.N. Donev, Optimum Experimental Designs. Clarendon Press, Oxford (1992).
Atwood, C.L., Sequences converging to D-optimal designs of experiments. Ann. Statist. 1 (1973) 342-352. CrossRef
Atwood, C.L., Convergent design sequences, for sufficiently regular optimality criteria. Ann. Statist. 4 (1976) 1124-1138. CrossRef
Böhning, D., A vertex-exchange-method in D-optimal design theory. Metrika 33 (1986) 337-347. CrossRef
Cominetti, R., Metric regularity, tangent sets, and second-order optimality conditions. Appl. Math. Optim. 21 (1990) 265-287. CrossRef
Cook, D. and Fedorov, V., Constrained optimization of experimental design. Statistics 26 (1995) 129-178. CrossRef
D.J. Daley and D. Vere–Jones, An Introduction to the Theory of Point Processes. Springer, New York (1988).
N. Dunford and J.T. Schwartz, Linear Operators. Part I: General Theory. Wiley, New York (1988).
V.V. Fedorov, Theory of Optimal Experiments. Academic Press, New York (1972).
Fedorov, V.V., Optimal design with bounded density: Optimization algorithms of the exchange type. J. Statist. Plan. Inf. 22 (1989) 1-13. CrossRef
V.V. Fedorov and P. Hackl, Model-Oriented Design of Experiments. Springer, New York, Lecture Notes in Statist. 125 (1997).
I. Ford, Optimal Static and Sequential Design: A Critical Review, Ph.D. Thesis. Department of Statistics, University of Glasgow, Glasgow (1976).
Gaivoronski, A., Linearization methods for optimization of functionals which depend on probability measures. Math. Progr. Study 28 (1986) 157-181. CrossRef
Gaffke, N. and Mathar, R., On a Class of Algorithms from Experimental Design Theory. Optimization 24 (1992) 91-126. CrossRef
E. Hille and R.S. Phillips, Functional Analysis and Semigroups. American Mathematical Society, Providence, AMS Colloquium Publications XXXI (1957).
Kiefer, J., General equivalence theory for optimum designs (approximate theory). Ann. Statist. 2 (1974) 849-879. CrossRef
Kiefer, J. and Wolfowitz, J., The equivalence of two extremal problems. Canad. J. Math. 14 (1960) 363-366. CrossRef
Kumaravelu, P., Hook, L., Morrison, A.M., Ure, J., Zhao, S., Zuyev, S., Ansell, J. and Medvinsky, A., Quantitative developmental anatomy of definitive haematopoietic stem cells/long-term repopulating units (HSC/RUs): Role of the aorta-gonad-mesonephros (AGM) region and the yolk sac in colonisation of the mouse embryonic liver. Development 129 (2002) 4891-4899.
E.P. Liski, N.K. Mandal, K.R. Shah and B.K. Singha, Topics in Optimal Design. Springer, New York, Lect. Notes Statist. 163 (2002).
Maurer, H. and Zowe, J., First and second-order necessary and sufficient optimality conditions for infinite-dimensional programming problems. Math. Programming 16 (1979) 98-110. CrossRef
Molchanov, I. and Zuyev, S., Steepest descent algorithms in space of measures. Statist. and Comput. 12 (2002) 115-123. CrossRef
Molchanov, I. and Zuyev, S., Tangent sets in the space of measures: With applications to variational calculus. J. Math. Anal. Appl. 249 (2000) 539-552. CrossRef
Molchanov, I. and Zuyev, S., Variational analysis of functionals of a Poisson process. Math. Oper. Res. 25 (2000) 485-508. CrossRef
Müller, C.H. and Pázman, A., Applications of necessary and sufficient conditions for maximin efficient designs. Metrika 48 (1998) 1-19.
Pázman, A., Hilbert-space methods in experimantal design. Kybernetika 14 (1978) 73-84.
E. Polak, Optimization. Algorithms and Consistent Approximations. Springer, New York (1997).
F. Pukelsheim, Optimal Design of Experiments. Wiley, New York (1993).
Robinson, S.M., First order conditions for general nonlinear optimization. SIAM J. Appl. Math. 30 (1976) 597-607. CrossRef
S.D. Silvey, Optimum Design. Chapman & Hall, London (1980).
D. Stoyan, W.S. Kendall and J. Mecke, Stochastic Geometry and its Applications, Second Edition. Wiley, Chichester (1995).
Whittle, P., Some general points in the theory of optimal experimental design. J. Roy. Statist. Soc. Ser. B 35 (1973) 123-130.
Winkler, G., Extreme points of moment sets. Math. Oper. Res. 13 (1988) 581-587. CrossRef
Some, C.-F. Wu algorithmic aspects of the theory of optimal design. Ann. Statist. 6 (1978) 1286-1301.
Some, C.-F. Wu iterative procedures for generating nonsingular optimal designs. Comm. Statist. Theory Methods A 7 (1978) 1399-1412.
Wu, C.-F. and Wynn, H.P., The convergence of general step-length algorithms for regular optimum design criteria. Ann. Statist. 6 (1978) 1273-1285. CrossRef
Wynn, H.P., The sequential generation of D-optimum experimental designs. Ann. Math. Statist. 41 (1970) 1655-1664. CrossRef
Wynn, H.P., Results in the theory and construction of D-optimum experimental designs. J. Roy. Statist. Soc. Ser. B 34 (1972) 133-147.
Zowe, J. and Kurcyusz, S., Regularity and stability for the mathematical programming problem in Banach spaces. Appl. Math. Optim. 5 (1979) 49-62. CrossRef