On greedy heuristics for computing D-efficient saturated subsets
From MaRDI portal
Publication:1984679
DOI10.1016/j.orl.2020.01.003OpenAlexW3002909912MaRDI QIDQ1984679
Publication date: 7 April 2020
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.07647
D-optimalitysubsamplingoptimal experimental designgreedy heuristicminimum-volume enclosing ellipsoid
Related Items (3)
Computing minimum-volume enclosing ellipsoids for large datasets ⋮ Optimal design of multifactor experiments via grid exploration ⋮ Circuits for robust designs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- D-optimal designs via a cocktail algorithm
- Minimum-volume enclosing ellipsoids and core sets
- Replicationfree optimal design in regression analysis
- Principles of experimental design for big data analysis
- Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs
- Optimal design with bounded density: Optimization algorithms of the exchange type
- Design of experiments in nonlinear models. Asymptotic normality, optimality criteria and small-sample properties
- Fast algorithms for the minimum volume estimator
- Approximating the volume of convex bodies
- Minimum-Volume Ellipsoids
- On the singularity probability of random Bernoulli matrices
- Estimation of Correlation Coefficients by Ellipsoidal Trimming
- Time- and Space-Saving Computer Methods, Related to Mitchell's DETMAX, for Finding D-Optimum Designs
- Optimal design: Some geometrical aspects of D-optimality
- A Ridge-Type Procedure for Design of Experiments
- An analysis of approximations for maximizing submodular set functions—I
- Optimal Supersaturated Designs
- Information-Based Optimal Subdata Selection for Big Data Linear Regression
- On Optimal Designs for Nonlinear Models: A General and Efficient Algorithm
- Screening
- A geometric approach to optimal design theory
This page was built for publication: On greedy heuristics for computing D-efficient saturated subsets
