Pages that link to "Item:Q3909865"
From MaRDI portal
The following pages link to A Comparison of Algorithms for Constructing Exact D-Optimal Designs (Q3909865):
Displaying 50 items.
- Optimal design of multi-response experiments using semi-definite programming (Q374619) (← links)
- Efficient computational algorithm for optimal allocation in regression models (Q390453) (← links)
- Optimal measurement conditions for spatiotemporal EEG/MEG source analysis (Q463104) (← 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)
- Bayesian U-type design for nonparametric response surface prediction (Q604642) (← links)
- Multiplicative algorithms for computing optimum designs (Q730813) (← links)
- Sequential online subsampling for thinning experimental designs (Q830692) (← links)
- \(D\)-optimal and near \(D\)-optimal \(2^k\) fractional factorial designs of resolution V (Q953836) (← links)
- Trend-resistant and cost-efficient cross-over designs for mixed models (Q956978) (← links)
- Optimal designs to select individuals for genotyping conditional on observed binary or survival outcomes and non-genetic covariates (Q961350) (← links)
- D-optimal \((0,1)\)-weighing designs for eight objects (Q962096) (← links)
- Minimal sampling schedules for identification of dynamic models of metabolic systems of clinical interest: Case studies for two liver function tests (Q1052255) (← links)
- On the design of experiments in the presence of fixed covariates (Q1118952) (← links)
- Design measures and approximate information matrices for experiments without replications (Q1299457) (← links)
- A new approach to the construction of optimal designs (Q1329698) (← links)
- Construction of exact D-optimal designs by tabu search (Q1351866) (← links)
- Computing efficient exact designs of experiments using integer quadratic programming (Q1621402) (← links)
- Factorial and response surface designs robust to missing observations (Q1658165) (← links)
- Adaptive grid semidefinite programming for finding optimal designs (Q1702022) (← links)
- Sequential sampling designs for the two-parameter item response theory model (Q1803389) (← links)
- Optimal designs for criteria involving log(potency) in comparative binary bioassays (Q1873098) (← links)
- Budget constrained run orders in optimum design (Q1878847) (← links)
- Sparse polynomial chaos expansions via compressed sensing and D-optimal design (Q1985532) (← links)
- Optimized gauging for tire-rim loading identification (Q2035162) (← links)
- A branch-and-bound algorithm for the exact optimal experimental design problem (Q2058883) (← links)
- Ta algorithms for D-optimal OofA mixture designs (Q2076166) (← links)
- \(D\)-optimal design for a causal structure for completely randomized and random blocked experiments (Q2095788) (← 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)
- Multi-stage differential evolution algorithm for constrained D-optimal design (Q2146662) (← links)
- Design optimal sampling plans for functional regression models (Q2178158) (← links)
- Workweek optimization of experimental designs: exact designs for variable sampling costs (Q2260184) (← links)
- A receding horizon \(D\)-optimization approach for model identification-oriented input design and application in combustion engines (Q2284525) (← links)
- A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs (Q2291279) (← links)
- Optimal exact designs of experiments via mixed integer nonlinear programming (Q2302472) (← links)
- Optimal designs in sparse linear models (Q2303755) (← links)
- Least squares polynomial chaos expansion: a review of sampling strategies (Q2310855) (← links)
- Efficiency of the coordinate-exchange algorithm in constructing exact optimal discrete choice experiments (Q2324028) (← links)
- On using the hypervolume indicator to compare Pareto fronts: applications to multi-criteria optimal experimental design (Q2344385) (← links)
- Exact optimal experimental designs with constraints (Q2361462) (← links)
- Optimal U-type design for Bayesian nonparametric multiresponse prediction (Q2431588) (← links)
- A review of some exchange algorithms for constructing discrete \(D\)-optimal designs (Q2563622) (← links)
- Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm (Q2631342) (← links)
- Sequential Bayesian Polynomial Chaos Model Selection for Estimation of Sensitivity Indices (Q2945143) (← links)
- Optimum experimental design in nonlinear regression (Q3361754) (← links)
- Generation of d–optimal designs in a finite design space (Q3471544) (← links)
- Multi-fidelity optimization via surrogate modelling (Q3508105) (← links)
- Model-Robust Design of Conjoint Choice Experiments (Q3543705) (← links)
