Convex Optimal Designs for Group Testing Experiments

[Up] [Top]

Documentation for package ‘gtDesign’ version 0.1.0

Help Pages

calc_Aopt A-optimal approximate design for group testing experiments
calc_copt c-optimal approximate design for group testing experiments
calc_directional_derivatives Directional derivatives on a finite candidate set
calc_Dopt D-optimal approximate design for group testing experiments
calc_Eopt E-optimal approximate design for group testing experiments
calc_eta_weights_maximin Eta weights for the maximin equivalence theorem
calc_multi_directional_derivative Weighted multi-objective directional derivative
check_equivalence Check the equivalence theorem on a finite candidate set
check_equivalence_maximin Check the equivalence theorem for a maximin design
compute_design_SO Single-objective optimal approximate design (group testing)
compute_maximin_design Maximin multi-criterion approximate design (group testing)
exact_design_efficiency_maximin Efficiencies of an exact design relative to single-objective optima (maximin)
gt_huang2020_cost Standardized cost for pool size (Huang et al. 2020)
gt_huang2020_f Gradient vector \mathbf{f}(x) for the Huang et al. (2020) model
gt_huang2020_lambda Weight lambda(x) in the information matrix (Huang et al. 2020)
gt_huang2020_pi Positive test probability (Huang et al. 2020 / arXiv:2508.08445 Sec. 2)
gt_huang2020_regressor Effective regressor sqrt{lambda(x)}\,\mathbf{f}(x) for convex design code
maximin_design_workflow Maximin design with reference losses, equivalence, and eta (workflow)
plot_equivalence Plot equivalence theorem directional derivative
plot_equivalence_maximin Plot equivalence diagnostics for a maximin design
rounding_budget_combinations Enumerate budget-feasible integer allocations (cost-aware rounding)
rounding_run_size_combinations Enumerate nonnegative integer allocations (run-size rounding)
round_gt_design_budget Exact group-testing design under a fixed budget (Rounding Algorithm II)
round_gt_design_budget_maximin Exact maximin design under fixed budget (Algorithm II + search)
round_gt_design_n_maximin Exact maximin design under fixed run size (Algorithm I + search)
round_gt_design_subject_budget Exact design under subject-count constraint via budget rounding