Heuristic optimization of experimental designs.

DOI10.1016/S0377-2217(02)00292-8zbMath1037.90058MaRDI QIDQ1872999

Miguel A. Lejeune

Publication date: 19 May 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

algorithm; Simulated annealing; D-efficiency; Design of experiments; Heuristic optimization; Exchange

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Generating and improving orthogonal designs by using mixed integer programming, Optimal designs to select individuals for genotyping conditional on observed binary or survival outcomes and non-genetic covariates, Finding multiple optimal solutions of signomial discrete programming problems with free variables, Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Some Guidelines for Constructing Exact D-Optimal Designs on Convex Design Spaces
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Generalized Simulated Annealing for Function Optimization
• The Application of the Annealing Algorithm to the Construction of Exact Optimal Designs for Linear-Regression Models
• Constructing Exact D-Optimal Experimental Designs by Simulated Annealing
• Time- and Space-Saving Computer Methods, Related to Mitchell's DETMAX, for Finding D-Optimum Designs
• D-Optimality for Regression Designs: A Review
• An Algorithm for the Construction of "D-Optimal" Experimental Designs
• Computer Construction of "D-Optimal" First-Order Designs
• The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
• The Sequential Generation of $D$-Optimum Experimental Designs
• Factorial Designs, the |X′X| Criterion, and Some Related Matters