Pages that link to "Item:Q4066429"
From MaRDI portal
The following pages link to Optimal design: Some geometrical aspects of D-optimality (Q4066429):
Displaying 33 items.
- Exact primitives for smallest enclosing ellipses (Q293400) (← links)
- Rank-two update algorithms for the minimum volume enclosing ellipsoid problem (Q434159) (← links)
- CDT-optimum designs for model discrimination, parameter estimation and estimation of a parametric function (Q607171) (← links)
- Conditional minimum volume ellipsoid with application to multiclass discrimination (Q732238) (← links)
- Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms (Q870328) (← links)
- Defining extremes and trimming by minimum covering sets (Q916195) (← links)
- Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs (Q961114) (← links)
- On the duality between locally optimal tests and optimal experimental designs (Q1069250) (← links)
- On optimal designs and complete class theorems for experiments with continuous and discrete factors of influence (Q1086954) (← links)
- On linear regression designs which maximize information (Q1157861) (← links)
- Improved feasible solution algorithms for high breakdown estimation. (Q1285475) (← links)
- D-optimal design methods for robust estimation of multivariate location and scatter (Q1299089) (← links)
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope (Q1315411) (← links)
- Minimum-volume ellipsoids containing compact sets: Application to parameter bounding (Q1345621) (← links)
- Removing non-optimal support points in \(D\)-optimum design algorithms. (Q1423173) (← links)
- A review of reliable maximum likelihood algorithms for semiparametric mixture models (Q1901749) (← links)
- On greedy heuristics for computing D-efficient saturated subsets (Q1984679) (← links)
- Computing minimum-volume enclosing ellipsoids for large datasets (Q2129596) (← links)
- Multimodal information gain in Bayesian design of experiments (Q2135895) (← links)
- Uniform distributions and random variate generation over generalized \(l_p\) balls and spheres (Q2317290) (← links)
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids (Q2381536) (← links)
- Optimal experimental design and some related control problems (Q2440603) (← links)
- Kantorovich-type inequalities for operators via \(D\)-optimal design theory (Q2575706) (← links)
- QUANTILE APPROXIMATION FOR ROBUST STATISTICAL ESTIMATION AND k-ENCLOSING PROBLEMS (Q2708040) (← links)
- A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids (Q2958363) (← links)
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments (Q3304857) (← links)
- An introduction to designh optimality with an overview of the literature (Q4171460) (← links)
- Minimal volume ellipsoids (Q4293121) (← links)
- On the elimination of inessential points in the smallest enclosing ball problem (Q4622883) (← links)
- Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies (Q5200559) (← links)
- Robust Winsorized Regression Using Bootstrap Approach (Q5305492) (← links)
- Trimmed \(\tilde T^2\): A robust analog of Hotelling's \(T^2\) (Q5945263) (← links)
- Computing minimum-volume enclosing ellipsoids (Q6062882) (← links)
