Constructing Exact D-Optimal Experimental Designs by Simulated Annealing

DOI10.1080/01966324.1988.10737244zbMath0676.65148OpenAlexW1985725655WikidataQ58117255 ScholiaQ58117255MaRDI QIDQ3832034

Ruth K. Meyer, Christopher J. Nachtsheim

Publication date: 1988

Published in: American Journal of Mathematical and Management Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01966324.1988.10737244

zbMATH Keywords

convergenceD-optimalitynonlinear optimizationsimulated annealing algorithmexchange algorithmsexperimental designsBranch-and-bound methodsExact optimal designs

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Probabilistic methods, stochastic differential equations (65C99)

Related Items (19)

Heuristic optimization of experimental designs. ⋮ The mixture design threshold accepting algorithm for generating \(D\)-optimal designs of the mixture models ⋮ A new approach to the construction of optimal designs ⋮ Computing efficient exact designs of experiments using integer quadratic programming ⋮ Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm ⋮ An efficient algorithm for Elastic I‐optimal design of generalized linear models ⋮ An integrative framework for geometric and hidden projections in three-level fractional factorial designs ⋮ Robust designs for misspecified logistic models ⋮ Robust estimators and designs for field experiments ⋮ Discrete M-robust designs for regression models ⋮ D-optimal minimax design criterion for two-level fractional factorial designs ⋮ Practical considerations for experimental designs of spatially autocorrelated data using computer intensive methods ⋮ \((\mathcal D_t,C)\)-optimal run orders ⋮ Exchange algorithms for constructing large spatial designs ⋮ Discrete minimax designs for regression models with autocorrelated MA errors ⋮ Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs ⋮ A clustering-based coordinate exchange algorithm for generating G-optimal experimental designs ⋮ Constructing Efficient Experimental Designs for Generalized Linear Models ⋮ Least squares polynomial chaos expansion: a review of sampling strategies

Cites Work

• A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
• On the Efficient Design of Statistical Investigations

This page was built for publication: Constructing Exact D-Optimal Experimental Designs by Simulated Annealing