Time- and Space-Saving Computer Methods, Related to Mitchell's DETMAX, for Finding D-Optimum Designs

DOI10.2307/1268314zbMath0459.62060OpenAlexW4245521572MaRDI QIDQ3909864

J. Kiefer, Zvi Galil

Publication date: 1980

Full work available at URL: https://doi.org/10.2307/1268314

zbMATH Keywords

linear regressionnumerical optimizationcomputer searchquadratic regressionweighing designsD- optimalityDETMAX

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Computing methodologies and applications (68U99) Probabilistic methods, stochastic differential equations (65C99)

Related Items (14)

Heuristic optimization of experimental designs. ⋮ A new approach to the construction of optimal designs ⋮ Construction of symmetric orthogonal designs with deep Q-network and orthogonal complementary design ⋮ Construction of exact D-optimal designs by tabu search ⋮ Generation of d–optimal designs in a finite design space ⋮ Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem ⋮ Efficient maximin distance designs for experiments in mixtures ⋮ On greedy heuristics for computing D-efficient saturated subsets ⋮ \(D\)-optimal and near \(D\)-optimal \(2^k\) fractional factorial designs of resolution V ⋮ Partially replicated two-level fractional factorial designs ⋮ Optimized gauging for tire-rim loading identification ⋮ Dynamic Programming Approach to Load Estimation Using Optimal Sensor Placement and Model Reduction ⋮ A review of some exchange algorithms for constructing discrete \(D\)-optimal designs ⋮ A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models

This page was built for publication: Time- and Space-Saving Computer Methods, Related to Mitchell's DETMAX, for Finding D-Optimum Designs