Some Guidelines for Constructing Exact D-Optimal Designs on Convex Design Spaces
From MaRDI portal
Publication:3040360
DOI10.2307/1268612zbMath0526.62070MaRDI QIDQ3040360
Mark E. Johnson, Christopher J. Nachtsheim
Publication date: 1983
Published in: Technometrics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1268612
nonlinear optimization; exchange algorithms; conjugate directions; simplex search; constructing exact D-optimal designs; convex design spaces; multiple- point augmentation; single-point procedures
62K05: Optimal statistical designs
65K10: Numerical optimization and variational techniques
65C99: Probabilistic methods, stochastic differential equations
Related Items
Dynamic Programming Approach to Load Estimation Using Optimal Sensor Placement and Model Reduction, \((\mathcal D_t,C)\)-optimal run orders, Exchange algorithms for constructing large spatial designs, Some refinements on Fedorov's algorithms for constructing D-optimal designs, \(D\)-optimal and near \(D\)-optimal \(2^k\) fractional factorial designs of resolution V, Model-robust supersaturated and partially supersaturated designs, A general equation and optimal design for a 2-factor restricted region., Optimal design with bounded density: Optimization algorithms of the exchange type, Heuristic optimization of experimental designs., Sparse polynomial chaos expansions via compressed sensing and D-optimal design, Optimized gauging for tire-rim loading identification, Design optimal sampling plans for functional regression models, A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs, Optimal exact designs of experiments via mixed integer nonlinear programming, Least squares polynomial chaos expansion: a review of sampling strategies, Exact optimal experimental designs with constraints, Update formulas for split-plot and block designs, A review of some exchange algorithms for constructing discrete \(D\)-optimal designs, Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm
