Construction of efficient experimental designs under multiple resource constraints
From MaRDI portal
Abstract: The aim of this paper is twofold. First, we introduce "resource constraints" as a general concept that covers many practical restrictions on experimental design. Second, for computing efficient exact designs of experiments under any combination of resource constraints, we propose a tabu search heuristic that uses some ideas of the Detmax procedure. To illustrate the scope and performance of our heuristic, we computed D-efficient designs for 1) a block model with limits on the numbers of blocks and on the availability of experimental material; 2) a quadratic regression model with simultaneous marginal and cost constraints; 3) a non-linear regression model with simultaneous direct and cost constraints. As we show, the proposed heuristic generates comparable or better results than algorithms specialized for computing optimal designs under less general constraints.
Recommendations
Cites work
- A heuristic method for solving redundancy optimization problems in complex systems
- A new technique for the characterization of graphs with a maximum number of spanning trees
- A nonlinear knapsack problem
- Algorithmic searches for optimal designs
- An Algorithm for the Construction of "D-Optimal" Experimental Designs
- Application of genetic algorithms to the construction of exact D-optimal designs
- Branch-and-Bound Search for Experimental Designs Based on D Optimality and Other Criteria
- Budget constrained run orders in optimum design
- Combinatorics of optimal designs
- Computing efficient exact designs of experiments using integer quadratic programming
- Construction of exact D-optimal designs by tabu search
- Construction of marginally and conditionally restricted designs using multiplicative algorithms
- D-optimal block designs with at most six varieties
- Design of Comparative Experiments
- Design of experiments in nonlinear models. Asymptotic normality, optimality criteria and small-sample properties
- Determinant Maximization with Linear Matrix Inequality Constraints
- Graph complexity and the laplacian matrix in blocked experiments
- Invited Discussion Paper Constrained Optimization of Experimental Design
- Marginally Restricted D-Optimal Designs
- Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
- Model-oriented design of experiments
- Multiplicative methods for computing \(D\)-optimal stratified designs of experiments
- Near-Optimal Designs for Dual Channel Microarray Studies
- On the computational complexity of reliability redundancy allocation in a series system
- Optimal design with bounded density: Optimization algorithms of the exchange type
- Optimum Allocation in Linear Regression Theory
- Optimum experimental designs, with SAS
- Statistics for Microarrays
- The Application of the Annealing Algorithm to the Construction of Exact Optimal Designs for Linear-Regression Models
- The Enumeration of Point Labelled Chromatic Graphs and Trees
- The number of spanning trees of a complete multipartite graph
- The Sequential Generation of D-Optimum Experimental Designs
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Workweek optimization of experimental designs: exact designs for variable sampling costs
Cited in
(14)- Approximate and exact optimal designs for \(2^k\) factorial experiments for generalized linear models via second order cone programming
- Optimal design of multifactor experiments via grid exploration
- Optimal approximate designs for comparison with control in dose-escalation studies
- Assignment of factors levels for design of experiments with resource constraints
- Tabu Search Variable Selection with Resource Constraints
- Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints
- scientific article; zbMATH DE number 3994816 (Why is no real title available?)
- Invited Discussion Paper Constrained Optimization of Experimental Design
- Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments
- Computational aspects of experimental designs in multiple-group mixed models
- Mixed-integer linear programming for computing optimal experimental designs
- An algorithm for computing generalized D -optimal allocation with cost consideration in regression models
- Dimension reduction for optimal design problems with Kronecker product structure
- Ascent with quadratic assistance for the construction of exact experimental designs
This page was built for publication: Construction of efficient experimental designs under multiple resource constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4628716)
