Some Guidelines for Constructing Exact D-Optimal Designs on Convex Design Spaces
DOI10.2307/1268612zbMATH Open0526.62070OpenAlexW4231937149MaRDI QIDQ3040360FDOQ3040360
Authors: 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 optimizationconjugate directionssimplex searchexchange algorithmsconstructing exact D-optimal designsconvex design spacesmultiple- point augmentationsingle-point procedures
Probabilistic methods, stochastic differential equations (65C99) Numerical optimization and variational techniques (65K10) Optimal statistical designs (62K05)
Cited In (21)
- A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs
- Model-robust supersaturated and partially supersaturated designs
- A review of some exchange algorithms for constructing discrete \(D\)-optimal designs
- A general equation and optimal design for a 2-factor restricted region.
- Optimal design with bounded density: Optimization algorithms of the exchange type
- Optimal experimental design: formulations and computations
- Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm
- Title not available (Why is that?)
- Sparse polynomial chaos expansions via compressed sensing and D-optimal design
- Optimized gauging for tire-rim loading identification
- Dynamic programming approach to load estimation using optimal sensor placement and model reduction
- Heuristic optimization of experimental designs.
- Exchange algorithms for constructing large spatial designs
- Least squares polynomial chaos expansion: a review of sampling strategies
- Some refinements on Fedorov's algorithms for constructing D-optimal designs
- Update formulas for split-plot and block designs
- \(D\)-optimal and near \(D\)-optimal \(2^k\) fractional factorial designs of resolution V
- Design optimal sampling plans for functional regression models
- Optimal exact designs of experiments via mixed integer nonlinear programming
- Exact optimal experimental designs with constraints
- \((\mathcal D_t,C)\)-optimal run orders
This page was built for publication: Some Guidelines for Constructing Exact D-Optimal Designs on Convex Design Spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3040360)