Constructing Exact D-Optimal Experimental Designs by Simulated Annealing

DOI10.1080/01966324.1988.10737244MaRDI QIDQ3832034zbMATH OpenOpenAlexWikidataFDO

Authors 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

Branch-and-bound methodsconvergenceD-optimalityExact optimal designsexchange algorithmsexperimental designsnonlinear optimizationsimulated annealing algorithm

Mathematics Subject Classification ID

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

Recommendations

• The Application of the Annealing Algorithm to the Construction of Exact Optimal Designs for Linear-Regression Models
• Heuristic optimization of experimental designs.
• Optimal exact experimental designs with correlated errors through a simulated annealing algorithm
• A new approach to the construction of optimal designs
• An Adjustment Algorithm for the Construction of Exact D-Optimum Experimental Designs

Cites work

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

Cited in

(25)

• A new approach to the construction of optimal designs
• Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs
• Optimal exact experimental designs with correlated errors through a simulated annealing algorithm
• Computing efficient exact designs of experiments using integer quadratic programming
• Discrete M-robust designs for regression models
• Heuristic optimization of experimental designs.
• A branch-and-bound algorithm for the exact optimal experimental design problem
• The mixture design threshold accepting algorithm for generating D-optimal designs of the mixture models
• An integrative framework for geometric and hidden projections in three-level fractional factorial designs
• Least squares polynomial chaos expansion: a review of sampling strategies
• Robust estimators and designs for field experiments
• Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm
• Constructing efficient experimental designs for generalized linear models
• Pareto simulated annealing for the design of experiments: illustrated by a gene expression study
• The Application of the Annealing Algorithm to the Construction of Exact Optimal Designs for Linear-Regression Models
• An Adjustment Algorithm for the Construction of Exact D-Optimum Experimental Designs
• A clustering-based coordinate exchange algorithm for generating G-optimal experimental designs
• \((\mathcal D_t,C)\)-optimal run orders
• Exchange algorithms for constructing large spatial designs
• An efficient algorithm for Elastic I‐optimal design of generalized linear models
• On designing experiments for a dynamic response modeled by regression splines
• D-optimal minimax design criterion for two-level fractional factorial designs
• Practical considerations for experimental designs of spatially autocorrelated data using computer intensive methods
• Robust designs for misspecified logistic models
• Discrete minimax designs for regression models with autocorrelated MA errors

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3832034)