A Comparison of Algorithms for Constructing Exact D-Optimal Designs
From MaRDI portal
Publication:3909865
DOI10.2307/1268315zbMath0459.62061OpenAlexW4255347505MaRDI QIDQ3909865
R. Dennis Cook, Christopher J. Nachtsheim
Publication date: 1980
Full work available at URL: https://doi.org/10.2307/1268315
exchange algorithmcomputer searchmixture designsempirical comparison of algorithmscomputer generation of exact D- optimal experimental designs
Software, source code, etc. for problems pertaining to statistics (62-04) Optimal statistical designs (62K05) Probabilistic methods, stochastic differential equations (65C99)
Related Items
Optimal designs for criteria involving log(potency) in comparative binary bioassays, The mixture design threshold accepting algorithm for generating \(D\)-optimal designs of the mixture models, A new approach to the construction of optimal designs, Exact optimal experimental designs with constraints, Budget constrained run orders in optimum design, Computing efficient exact designs of experiments using integer quadratic programming, Sequential online subsampling for thinning experimental designs, Application of genetic algorithms to the construction of exact D-optimal designs, Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm, Response surface optimization for a nonlinearly constrained irregular experimental design space, Construction of exact D-optimal designs by tabu search, Multi-stage differential evolution algorithm for constrained D-optimal design, Generation of d–optimal designs in a finite design space, Factorial and response surface designs robust to missing observations, On the design of experiments in the presence of fixed covariates, Optimal design of multi-response experiments using semi-definite programming, Bayesian U-type design for nonparametric response surface prediction, Design optimal sampling plans for functional regression models, A Local Search Framework for Experimental Design, Sequential Bayesian Polynomial Chaos Model Selection for Estimation of Sensitivity Indices, Efficient computational algorithm for optimal allocation in regression models, Regression models for order‐of‐addition experiments, Multi-fidelity optimization via surrogate modelling, Optimal U-type design for Bayesian nonparametric multiresponse prediction, Adaptive grid semidefinite programming for finding optimal designs, Efficient maximin distance designs for experiments in mixtures, Optimal measurement conditions for spatiotemporal EEG/MEG source analysis, Model-Robust Design of Conjoint Choice Experiments, Combined algorithm to compute D-optimal designs, Some refinements on Fedorov's algorithms for constructing D-optimal designs, Sparse polynomial chaos expansions via compressed sensing and D-optimal design, \(D\)-optimal and near \(D\)-optimal \(2^k\) fractional factorial designs of resolution V, A hybrid elitist Pareto-based coordinate exchange algorithm for constructing multi-criteria optimal experimental designs, Trend-resistant and cost-efficient cross-over designs for mixed models, Optimal designs to select individuals for genotyping conditional on observed binary or survival outcomes and non-genetic covariates, D-optimal \((0,1)\)-weighing designs for eight objects, Workweek optimization of experimental designs: exact designs for variable sampling costs, \((\mathcal D_t,C)\)-optimal run orders, Exchange algorithms for constructing large spatial designs, Optimum experimental design in nonlinear regression, A receding horizon \(D\)-optimization approach for model identification-oriented input design and application in combustion engines, Optimized gauging for tire-rim loading identification, Unnamed Item, Multiplicative algorithms for computing optimum designs, A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs, Sequential sampling designs for the two-parameter item response theory model, Optimal exact designs of experiments via mixed integer nonlinear programming, Experimental design in the context of Tikhonov regularized inverse problems, Optimal designs in sparse linear models, A clustering-based coordinate exchange algorithm for generating G-optimal experimental designs, A branch-and-bound algorithm for the exact optimal experimental design problem, Least squares polynomial chaos expansion: a review of sampling strategies, Ta algorithms for D-optimal OofA mixture designs, Efficiency of the coordinate-exchange algorithm in constructing exact optimal discrete choice experiments, Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark, A review of some exchange algorithms for constructing discrete \(D\)-optimal designs, Layers of Experiments with Adaptive Combined Design, Design measures and approximate information matrices for experiments without replications, Minimal sampling schedules for identification of dynamic models of metabolic systems of clinical interest: Case studies for two liver function tests, \(D\)-optimal design for a causal structure for completely randomized and random blocked experiments, On using the hypervolume indicator to compare Pareto fronts: applications to multi-criteria optimal experimental design, Constructing two-level \(Q_B\)-optimal screening designs using mixed-integer programming and heuristic algorithms, Bayesian two-stage optimal design for mixture models
