Pages that link to "Item:Q4840422"
From MaRDI portal
The following pages link to The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs (Q4840422):
Displayed 50 items.
- D-optimality of non-regular design spaces by using a Bayesian modification and a hybrid method (Q381500) (← links)
- Efficient computational algorithm for optimal allocation in regression models (Q390453) (← links)
- Combined algorithm to compute D-optimal designs (Q475667) (← links)
- Some refinements on Fedorov's algorithms for constructing D-optimal designs (Q481423) (← links)
- A hybrid elitist Pareto-based coordinate exchange algorithm for constructing multi-criteria optimal experimental designs (Q518250) (← links)
- A comparison of three approaches for constructing robust experimental designs (Q539810) (← links)
- Adaptive sequential design for regression on multi-resolution bases (Q693303) (← links)
- Multiplicative algorithms for computing optimum designs (Q730813) (← links)
- On minimally-supported \(D\)-optimal designs for polynomial regression with log-concave weight function (Q870518) (← links)
- The construction of optimal designs for dose-escalation studies (Q892451) (← links)
- \(D\)-optimal and near \(D\)-optimal \(2^k\) fractional factorial designs of resolution V (Q953836) (← links)
- Screening designs for model discrimination (Q1044071) (← links)
- Augmenting supersaturated designs with Bayesian \(D\)-optimality (Q1621401) (← links)
- Computing efficient exact designs of experiments using integer quadratic programming (Q1621402) (← links)
- Robustness of classical and optimal designs to missing observations (Q1658162) (← links)
- Factorial and response surface designs robust to missing observations (Q1658165) (← links)
- An algorithmic framework for generating optimal two-stratum experimental designs (Q1658390) (← links)
- Optimal Bayesian design for discriminating between models with intractable likelihoods in epidemiology (Q1662873) (← links)
- An approach for finding fully Bayesian optimal designs using normal-based approximations to loss functions (Q1702013) (← links)
- Adaptive grid semidefinite programming for finding optimal designs (Q1702022) (← links)
- Efficient computational algorithm for optimal continuous experimental designs (Q1713154) (← links)
- Improving the efficiency of fully Bayesian optimal design of experiments using randomised quasi-Monte Carlo (Q1752009) (← links)
- Heuristic optimization of experimental designs. (Q1872999) (← links)
- Sparse polynomial chaos expansions via compressed sensing and D-optimal design (Q1985532) (← links)
- Mixed-level column augmented uniform designs (Q2001206) (← links)
- Using SeDuMi to find various optimal designs for regression models (Q2010813) (← links)
- Optimized gauging for tire-rim loading identification (Q2035162) (← links)
- A branch-and-bound algorithm for the exact optimal experimental design problem (Q2058883) (← links)
- Optimal design of multifactor experiments via grid exploration (Q2058892) (← links)
- Constructing two-level \(Q_B\)-optimal screening designs using mixed-integer programming and heuristic algorithms (Q2104010) (← links)
- The mixture design threshold accepting algorithm for generating \(D\)-optimal designs of the mixture models (Q2121428) (← links)
- Optimal Bayesian design for model discrimination via classification (Q2128059) (← links)
- An integrative framework for geometric and hidden projections in three-level fractional factorial designs (Q2242858) (← links)
- A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs (Q2291279) (← links)
- Bayesian design of experiments for intractable likelihood models using coupled auxiliary models and multivariate emulation (Q2297233) (← links)
- Optimal exact designs of experiments via mixed integer nonlinear programming (Q2302472) (← links)
- Least squares polynomial chaos expansion: a review of sampling strategies (Q2310855) (← links)
- Constructing definitive screening designs using cyclic generators (Q2320878) (← links)
- Efficiency of the coordinate-exchange algorithm in constructing exact optimal discrete choice experiments (Q2324028) (← links)
- A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments (Q2329497) (← links)
- Effect of choice complexity on design efficiency in conjoint choice experiments (Q2431571) (← links)
- Obtaining more information from conjoint experiments by best-worst choices (Q2445592) (← links)
- A comparison of design and model selection methods for supersaturated experiments (Q2445769) (← links)
- Update formulas for split-plot and block designs (Q2445793) (← links)
- D-optimal design of a monitoring network for parameter estimation of distributed systems (Q2454730) (← links)
- Bayesian D-optimal supersaturated designs (Q2474410) (← links)
- Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm (Q2631342) (← links)
- Bayesian D-Optimal Design Issues for Binomial Generalized Linear Model Screening Designs (Q2787324) (← links)
- Efficient computational algorithms for approximate optimal designs (Q3390584) (← links)
- Balanced Asymmetrical Nearly Orthogonal Designs for first and second order effect estimation (Q3592571) (← links)