Optimal design: Some geometrical aspects of D-optimality

Cited in

(34)

On the duality between locally optimal tests and optimal experimental designs
On optimal designs and complete class theorems for experiments with continuous and discrete factors of influence
On linear regression designs which maximize information
Improved feasible solution algorithms for high breakdown estimation.
D-optimal design methods for robust estimation of multivariate location and scatter
On the complexity of approximating the maximal inscribed ellipsoid for a polytope
Minimum-volume ellipsoids containing compact sets: Application to parameter bounding
Removing non-optimal support points in \(D\)-optimum design algorithms.
A review of reliable maximum likelihood algorithms for semiparametric mixture models
On greedy heuristics for computing D-efficient saturated subsets
Computing minimum-volume enclosing ellipsoids for large datasets
Multimodal information gain in Bayesian design of experiments
Uniform distributions and random variate generation over generalized \(l_p\) balls and spheres
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Optimal experimental design and some related control problems
Kantorovich-type inequalities for operators via \(D\)-optimal design theory
Quantile approximation for robust statistical estimation and \(k\)-enclosing problems
Exact primitives for smallest enclosing ellipses
A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids
A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
An introduction to designh optimality with an overview of the literature
Minimal volume ellipsoids
Rank-two update algorithms for the minimum volume enclosing ellipsoid problem
On the elimination of inessential points in the smallest enclosing ball problem
Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies
Robust winsorized regression using bootstrap approach
Trimmed \(\tilde T^2\): A robust analog of Hotelling's \(T^2\)
Computing minimum-volume enclosing ellipsoids
CDT-optimum designs for model discrimination, parameter estimation and estimation of a parametric function
Minimum volume covering ellipsoids
Conditional minimum volume ellipsoid with application to multiclass discrimination
Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
Defining extremes and trimming by minimum covering sets
Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs

This page was built for publication: Optimal design: Some geometrical aspects of D-optimality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4066429)