Abstract
We prove a mathematical programming characterization of approximate partial D-optimality under general linear constraints. We use this characterization with a branch-and-bound method to compute a list of all exact D-optimal designs for estimating a pair of treatment contrasts in the presence of a nuisance time trend up to the size of 24 consecutive trials.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
If 𝒞(A)⊆𝒞(M), then A T M − A does not depend on the choice of the generalized inverse of M.
References
Atkinson AC, Donev AN (1996) Experimental designs optimally balanced for trend. Technometrics 38(4):333–341
Atkinson AC, Donev AN, Tobias RD (2007) Optimum experimental designs, with SAS. Oxford University Press, New York
Cook D, Fedorov V (1995) Constrained optimization of experimental design. Statistics 26(2):129–148
Cox DR (1951) Some systematic experimental designs. Biometrika 38(3/4):312–323
Joshi S, Boyd S (2009) Sensor selection via convex optimization. IEEE Trans Signal Process 57(2):451–462
Pázman A (1986) Foundations of optimum experimental design. Reidel, Dordrecht
Papp D (2012) Optimal designs for rational function regression. J Am Stat Assoc 107(497):400–411
Pukelsheim F (2006) Optimal design of experiments. SIAM, Philadelphia
Tack L, Vandebroek M (2001) (𝒟 t ,c)-optimal run orders. J Stat Plan Inference 98(1-2):293–310
Sagnol G (2012) Picos, a python interface to conic optimization solvers. Technical report 12-48. ZIB: http://picos.zib.de
Uciński D, Patan M (2007) D-optimal design of a monitoring network for parameter estimation of distributed systems. J Glob Optim 39(2):291–322
Vandenberghe L (2010) The CVXOPT linear and quadratic cone program solvers. http://cvxopt.org/documentation/coneprog.pdf
Vandenberghe L, Boyd S, Wu SP (1998) Determinant maximization with linear matrix inequality constraints. SIAM J Matrix Anal Appl 19(2):499–533
Welch WJ (1982) Branch-and-bound search for experimental designs based on D-optimality and other criteria. Technometrics 24(1):41–48
Yu Y (2010) Monotonic convergence of a general algorithm for computing optimal designs. Ann Stat 38(3):1593–1606
Acknowledgements
The research of the first author was supported by the VEGA 1/0163/13 grant of the Slovak Scientific Grant Agency.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Harman, R., Sagnol, G. (2015). Computing D-Optimal Experimental Designs for Estimating Treatment Contrasts Under the Presence of a Nuisance Time Trend. In: Steland, A., Rafajłowicz, E., Szajowski, K. (eds) Stochastic Models, Statistics and Their Applications. Springer Proceedings in Mathematics & Statistics, vol 122. Springer, Cham. https://doi.org/10.1007/978-3-319-13881-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-13881-7_10
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13880-0
Online ISBN: 978-3-319-13881-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)