Pages that link to "Item:Q88784"

The following pages link to D-optimal designs via a cocktail algorithm (Q88784):

Displaying 35 items.

• Evaluation of Combinatorial Optimisation Algorithms for c-Optimal Experimental Designs with Correlated Observations (Q73947) (← links)
• optedr (Q88785) (← links)
• Multiplicative methods for computing \(D\)-optimal stratified designs of experiments (Q393589) (← links)
• Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria (Q460659) (← links)
• Combined algorithm to compute D-optimal designs (Q475667) (← links)
• Some refinements on Fedorov's algorithms for constructing D-optimal designs (Q481423) (← links)
• D-optimal designs based on the second-order least squares estimator (Q513688) (← links)
• Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments (Q513974) (← links)
• Computing exact \(D\)-optimal designs by mixed integer second-order cone programming (Q888509) (← links)
• Computing efficient exact designs of experiments using integer quadratic programming (Q1621402) (← links)
• Quasi-Newton algorithm for optimal approximate linear regression design: optimization in matrix space (Q1644428) (← links)
• Adaptive grid semidefinite programming for finding optimal designs (Q1702022) (← links)
• Efficient computational algorithm for optimal continuous experimental designs (Q1713154) (← links)
• On greedy heuristics for computing D-efficient saturated subsets (Q1984679) (← links)
• Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion (Q2023572) (← 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)
• The mixture design threshold accepting algorithm for generating \(D\)-optimal designs of the mixture models (Q2121428) (← links)
• Computing minimum-volume enclosing ellipsoids for large datasets (Q2129596) (← links)
• Multi-stage differential evolution algorithm for constrained D-optimal design (Q2146662) (← links)
• Multi-objective cellular particle swarm optimization and RBF for drilling parameters optimization (Q2160647) (← links)
• A new monotonic algorithm for the \(E\)-optimal experiment design problem (Q2244437) (← links)
• On optimal designs for nonregular models (Q2284376) (← links)
• A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs (Q2291279) (← links)
• Bayesian \(A\)-optimal design of experiment with quantitative and qualitative responses (Q2300104) (← links)
• On multiple-objective optimal designs (Q2317275) (← links)
• Efficiency of the coordinate-exchange algorithm in constructing exact optimal discrete choice experiments (Q2324028) (← links)
• A sparse control approach to optimal sensor placement in PDE-constrained parameter estimation problems (Q2334623) (← links)
• Fast algorithms for the minimum volume estimator (Q2349524) (← links)
• Exact optimal experimental designs with constraints (Q2361462) (← links)
• An unexpected connection between Bayes \(A\)-optimal designs and the group Lasso (Q2423178) (← links)
• A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria (Q2439646) (← links)
• A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments (Q3304857) (← links)
• Efficient computational algorithms for approximate optimal designs (Q3390584) (← links)
• Linear convergence of accelerated conditional gradient algorithms in spaces of measures (Q4999535) (← links)