Some Guidelines for Constructing Exact D-Optimal Designs on Convex Design Spaces

DOI10.2307/1268612zbMath0526.62070OpenAlexW4231937149MaRDI 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

zbMATH Keywords

nonlinear optimizationexchange algorithmsconjugate directionssimplex searchconstructing exact D-optimal designsconvex design spacesmultiple- point augmentationsingle-point procedures

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Numerical optimization and variational techniques (65K10) Probabilistic methods, stochastic differential equations (65C99)

Related Items (20)

Heuristic optimization of experimental designs. ⋮ Exact optimal experimental designs with constraints ⋮ Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm ⋮ Design optimal sampling plans for functional regression models ⋮ A general equation and optimal design for a 2-factor restricted region. ⋮ Update formulas for split-plot and block designs ⋮ Some refinements on Fedorov's algorithms for constructing D-optimal designs ⋮ Sparse polynomial chaos expansions via compressed sensing and D-optimal design ⋮ \(D\)-optimal and near \(D\)-optimal \(2^k\) fractional factorial designs of resolution V ⋮ Model-robust supersaturated and partially supersaturated designs ⋮ \((\mathcal D_t,C)\)-optimal run orders ⋮ Exchange algorithms for constructing large spatial designs ⋮ Optimized gauging for tire-rim loading identification ⋮ Unnamed Item ⋮ A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs ⋮ Dynamic Programming Approach to Load Estimation Using Optimal Sensor Placement and Model Reduction ⋮ Optimal exact designs of experiments via mixed integer nonlinear programming ⋮ Least squares polynomial chaos expansion: a review of sampling strategies ⋮ Optimal design with bounded density: Optimization algorithms of the exchange type ⋮ A review of some exchange algorithms for constructing discrete \(D\)-optimal designs

This page was built for publication: Some Guidelines for Constructing Exact D-Optimal Designs on Convex Design Spaces