The Application of the Annealing Algorithm to the Construction of Exact Optimal Designs for Linear-Regression Models
From MaRDI portal
Publication:3769806
DOI10.2307/1269455zbMath0632.62071OpenAlexW1983261599MaRDI QIDQ3769806
Publication date: 1987
Published in: Technometrics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1269455
D-optimalityI-optimalitysecond-order modelG-optimal designsannealing algorithmcomputer time and efficiencymodified Fedorov procedurepolynomial regression of degree 5
Linear regression; mixed models (62J05) Optimal statistical designs (62K05) Probabilistic methods, stochastic differential equations (65C99)
Related Items
Heuristic optimization of experimental designs. ⋮ 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 ⋮ Computing efficient exact designs of experiments using integer quadratic programming ⋮ Optimal experimental design for combinatorial problems ⋮ Minimax A- and D-optimal integer-valued wavelet designs for estimation ⋮ 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 ⋮ INTEGER-VALUED, MINIMAX ROBUST DESIGNS FOR APPROXIMATELY LINEAR MODELS WITH CORRELATED ERRORS ⋮ Construction of exact D-optimal designs by tabu search ⋮ Optimal sequential designs for on-line item estimation ⋮ Robust designs for binary data: applications of simulated annealing ⋮ Model selection via Bayesian information capacity designs for generalised linear models ⋮ Bayesian robust designs for linear models with possible bias and correlated errors ⋮ Spatial designs when the observations are correlated ⋮ Computing exact \(D\)-optimal designs by mixed integer second-order cone programming ⋮ An efficient algorithm for Elastic I‐optimal design of generalized linear models ⋮ Efficient maximin distance designs for experiments in mixtures ⋮ Efficient computational algorithm for optimal continuous experimental designs ⋮ A comparative study of robust designs for M-estimated regression models ⋮ A nested simulated annealing algorithm ⋮ Construction of efficient experimental designs under multiple resource constraints ⋮ A stochastic probing algorithm for global optimization ⋮ D-optimal minimax regression designs on discrete design space ⋮ Optimal designs for simultaneous item estimation ⋮ Robust estimators and designs for field experiments ⋮ New spherical 4-designs ⋮ Response surface design evaluation and comparison ⋮ A robust treatment of a dose–response study ⋮ Discrete M-robust designs for regression models ⋮ D-optimal minimax design criterion for two-level fractional factorial designs ⋮ \((\mathcal D_t,C)\)-optimal run orders ⋮ Exchange algorithms for constructing large spatial designs ⋮ Discrete minimax designs for regression models with autocorrelated MA errors ⋮ Multiplicative algorithms for computing optimum designs ⋮ Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs ⋮ A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs ⋮ New criteria for robust integer-valued designs in linear models ⋮ Minimax robust designs for field experiments ⋮ On exact minimax wavelet designs obtained by simulated annealing ⋮ A clustering-based coordinate exchange algorithm for generating G-optimal experimental designs ⋮ Least squares polynomial chaos expansion: a review of sampling strategies ⋮ Ascent with quadratic assistance for the construction of exact experimental designs ⋮ Exact Designs Minimising the Integrated Variance in Quadratic Regression ⋮ Optimal exact experimental designs with correlated errors through a simulated annealing algorithm
